Question

algorithm to find smallest two numbers from list

Answer 1

how many no.s are given??

Answer 2

its a sequence of numbers from 1 to n distinct

Answer 3

use an array to store this numbers. compare the first element of the array with the rest. if any no becomes smaller than the first no. while checking then replace the first no with the smaller one and continue the checking the the new no. at last you will get the smallest no. at the first position.

Answer 4

write algo that returns index of the first item that is less than its predecessor in sequence S1 ............. Sn, if s in nondecreasing order that algo returns the value 0

Answer 5

do u know C language?

Answer 6

ya i know

Answer 7

do u want the algo?

Answer 8

yes

Answer 9

take c as a array.
c={1st , 2nd,........nth}
for (i=0:1<n:i++)
{
if (c(0)<=c(i))
c(0)=c(i);
}
printf("\n %f ",c(0));

Answer 10

i think it works

Answer 11

thanks i wll try ok