find the k-th smallest element in O(logk) time

This is a discussion on find the k-th smallest element in O(logk) time within the C Programming forums, part of the General Programming Boards category; Please give me a hand to deal with it! 3 array A[1:l], B[1:m],C[1:n], all sorted in increasing order. for a ...

  1. #1
    Unregistered
    Guest

    find the k-th smallest element in O(logk) time

    Please give me a hand to deal with it!

    3 array A[1:l], B[1:m],C[1:n], all sorted in

    increasing order. for a integer 1<=k<=l+m+n, find an

    algorithm to find the k-th smallest element in the

    merge of A,B,C in O(logk) time. (assume that there's

    no duplicate numbers in A,B,C)

  2. #2
    Registered User pinko_liberal's Avatar
    Join Date
    Oct 2001
    Posts
    284
    hint : look at the quick sort algorithm carefully .
    HW ????

  3. #3
    Unregistered
    Guest
    I dont understand .
    the quick sort algorithm sort n elements in O(nlogn) time.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. need to find smallest int
    By lankeveil in forum C Programming
    Replies: 3
    Last Post: 11-30-2008, 04:48 AM
  2. I apologize. Good bye.
    By doubleanti in forum A Brief History of Cprogramming.com
    Replies: 14
    Last Post: 05-03-2002, 06:51 PM
  3. Is this really true or it's just science fiction?
    By Nutshell in forum A Brief History of Cprogramming.com
    Replies: 145
    Last Post: 04-09-2002, 06:17 PM
  4. Won't Return pointer, i can't find why...
    By ss3x in forum C++ Programming
    Replies: 2
    Last Post: 02-28-2002, 07:50 PM
  5. time class
    By Unregistered in forum C++ Programming
    Replies: 1
    Last Post: 12-11-2001, 09:12 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21