@Anand Also you cannot conclude that k will be middle. There is no mention of half. Its that only k<n. So you can also have something lke [9,1,2,3,4,5,6] = [9] & [1,2,3,4,5,6] [8,9,10,11,3,4,7,15,17] = [8,9,10,11] & [3,4,7,15,17] and so on....
Sourav On Jul 3, 1:32 am, Anand <anandut2...@gmail.com> wrote: > This is an example of bitonic sequence if we reverse the bottom half of the > array. > Sequence is called Bitonics if the sequence of number first > increases(ascending order) and then decrease(descending order). > > 1. We need to reverse the bottom half the array to make it bitonic. > 2. Appy Bitonic Merge to get the final sorted array.: Complexity.O(n) > > In the below code, I have implemented sorting n/w to sort any kind of array > but for bitonic sequence we only bitonic merge function call which take > O(n). > Refer section Sorting network from Corman for more details > > http://codepad.org/ZhYEBqMw > > On Fri, Jul 2, 2010 at 11:30 AM, ANKUR BHARDWAJ <ankibha...@gmail.com>wrote: > > > Given an array of n elements and an integer k where k<n. Elemnts > > {a[0].....a[k] and a[k+1].....a[n] are already sorted. Give an > > algorithm to sort in O(n) time and O(1) space. > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algoge...@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > > . > > 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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
