Timeline for Pancake sort inteview using java

13 events

when toggle format	what		by	license	comment
May 1, 2018 at 18:58	vote	accept	Anirudh Thatipelli
May 1, 2018 at 18:36	history	edited	200_success		edited tags; edited tags
May 1, 2018 at 18:28	answer	added	Koekje		timeline score: 1
May 1, 2018 at 16:27	answer	added	Eric Stein		timeline score: 2
May 1, 2018 at 14:52	comment	added	Koekje		But then it does not seem like a real pancake sort, you can not flip a stack of pancakes underneath another stack of pancakes.
May 1, 2018 at 14:41	comment	added	Anirudh Thatipelli		I redefined the function slightly to suit my needs
May 1, 2018 at 14:40	history	edited	Anirudh Thatipelli	CC BY-SA 3.0	deleted 53 characters in body
May 1, 2018 at 11:46	comment	added	Duarte Meneses		In the problem description it's written that you can only use `flip(arr, k)` but you implemented `flip(arr,start,k)`. Could you clarify this?
May 1, 2018 at 11:34	history	edited	mdfst13		edited tags
May 1, 2018 at 9:33	comment	added	Anirudh Thatipelli		That is so inefficient. I got it as a mock interview question. So, I want to know whether there exists a more efficient way to solve the question.
May 1, 2018 at 9:29	comment	added	Vogel612		For the record: pancake sort boils down to being a highly inefficient selection sort. The time-complexity will be n^2 * n :(
May 1, 2018 at 9:27	history	edited	Vogel612	CC BY-SA 3.0	added 16 characters in body
May 1, 2018 at 6:27	history	asked	Anirudh Thatipelli	CC BY-SA 3.0