if k is known to us the searching can be done in log(n) time if k is not known to us ,we first find the k then solution in O(n) time
correct me if i am worng... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
