Pancake sorting | GeeksforGeeks 1) Start from current size equal to n and reduce current size by one...

Please Visit: http://ift.tt/1ajReyV

Pancake sorting | GeeksforGeeks

1) Start from current size equal to n and reduce current size by one while it’s greater than 1. Let the current size be curr_size. Do following for every curr_size

……a) Find index of the maximum element in arr[0..curr_szie-1]. Let the index be ‘mi’

……b) Call flip(arr, mi)

……c) Call flip(arr, curr_size-1)

http://ift.tt/Wn6VpD

http://ift.tt/1qUd5Xq

Pancake sorting | GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/Wn6VpE

via LifeLong Community