JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
An<O(N), O(1)> algorithm for the restricted RMQ | Reply
To Solve the restrictive version How do we know we have to partition the array A into Blocks of Size I = (log N)/2.
Subject Author Date
An<O(N), O(1)> algorithm for the restricted RMQ JSaravanaKumar Aug 9, 2011 at 2:44 AM EDT
RSS