I guess she was asking that the per query complexity should be better that O(n).
If that is the case then you can use any of these Simple RMQ O(sqrt(n)) Segment/Interval Trees O(lgn) Binary Indexed Trees O(lgn) On Wed, Mar 31, 2010 at 12:58 PM, Rohit Saraf <[email protected]>wrote: > With only this info and without preprocessing , you need to scan all the N > integers in the list atleast once. Hence cannot be better than O(n). > If preprocessing is allowed you can compute the answers for all n^2 pairs > of x1,x2 and when some one asks , return the corresponding list. > In that case it would be better that O(n). !! > > -Rohit > > > > > On Wed, Mar 31, 2010 at 4:59 AM, Priyanka Chatterjee > <[email protected]>wrote: > >> Design an efficient algorithm to report all the points within x1 and x2 >> from a list of N integers. >> What data structure will you use to implement this algorithm? >> Find the order of complexity . ( An O(N) solution is not asked) >> >> >> -- >> Thanks & Regards, >> Priyanka Chatterjee >> Third Year Undergraduate Student, >> Computer Science & Engineering, >> National Institute Of Technology,Durgapur >> India >> http://priyanka-nit.blogspot.com/ >> >> -- >> 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. >> > > -- > 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. > -- 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.
