there are better solution of O(n) are posted in the thread.......[?]. using order statices ....
On Sun, Mar 28, 2010 at 6:49 PM, Mukesh Kumar thakur < [email protected]> wrote: > Create a temp array temp[0..k-1] of size k. > 2) Traverse the array arr[k..n-1]. While traversing, keep updating the > smallest element of temp[] > 3) Return the smallest of temp[] > Time Complexity: O((n-k)*k). > > > try it ..............for this problem[?] > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- ~~~~BL/\CK_D!AMOND~~~~~~~~ -- 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.
<<338.gif>>
<<361.gif>>
