We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 146d9ab + e36f47d commit be90705Copy full SHA for be90705
Sorting/Pancake sorting/pancake.py
@@ -0,0 +1,30 @@
1
+def flip(arr, i):
2
+ start = 0
3
+ while start < i:
4
+ temp = arr[start]
5
+ arr[start] = arr[i]
6
+ arr[i] = temp
7
+ start += 1
8
+ i -= 1
9
+
10
+def find_max(arr, n):
11
+ mi = 0
12
+ for i in range(0,n):
13
+ if arr[i] > arr[mi]:
14
+ mi = i
15
+ return mi
16
17
+def pancake_sort(arr, n):
18
19
+ curr_size = n
20
+ while curr_size > 1:
21
+ mi = find_max(arr, curr_size)
22
23
+ if mi != curr_size-1:
24
+ flip(arr, mi)
25
26
+ flip(arr, curr_size-1)
27
+ curr_size -= 1
28
29
+n = len(arr)
30
+pancake_sort(arr, n)
0 commit comments