@ ross yes its pancake sorting,although i have code using insertion
sort O(N^2) , we can use quick sort to achieve O(nlogn)
click here
http://shashank7s.blogspot.com/2011/03/pancake-sorting.html
Feel Free to Comment
Thanks
Shashank
CSE,BIT Mesra
--
You received this message because you are
@aashish,
Yeah, i went through the link, nice one dude! But, i believe even that
would be O(n2).
On Jun 12, 2:42 pm, ross jagadish1...@gmail.com wrote:
@piyush:
Hi piyush,
It is reverse the elements from i to j..
For example, 12 22 33 44 55 66 63
when given reverse (0,2) produces 33 22 12
