I think you ll need a secondary data structure (maybe another array - but I prefer a linked list) to flag or store something that could to index your main data structure (your array).

Of course, you ll need to feed the secondary structure -- The main question: WHERE ? If you could answer this question maybe our can suggest you some ways.

Luciano


Chris escreveu:

Nice try, but this problem has always been a sigificant point for DBMS
applications, web based or not.
Maybe i should better explain you the problem. Suppose that we have this
array below:

array = [ 0,1,2,3,4,5,7,8,9,10];

Which is the quickest way to find the missing sequential number in a sorted
array of a fixed lenght???

-
To unsubscribe from this list: send the line "unsubscribe linux-c-programming" 
in
the body of a message to [EMAIL PROTECTED]
More majordomo info at  http://vger.kernel.org/majordomo-info.html




-
To unsubscribe from this list: send the line "unsubscribe linux-c-programming" 
in
the body of a message to [EMAIL PROTECTED]
More majordomo info at  http://vger.kernel.org/majordomo-info.html

Reply via email to