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
