File tree 2 files changed +61
-0
lines changed
2 files changed +61
-0
lines changed Original file line number Diff line number Diff line change
1
+ # -*- coding: utf-8 -*-
2
+ """
3
+ Created on Fri Jan 26 18:26:21 2018
4
+
5
+ @author: Tirtha
6
+ """
7
+ import random
8
+
9
+ def quicksort (lst ):
10
+ #count_op=0
11
+ smaller = []
12
+ equal = []
13
+ bigger = []
14
+ if len (lst )== 0 or len (lst )== 1 :
15
+ return (lst )
16
+ else :
17
+ pivot = lst [0 ]
18
+ for n in lst :
19
+ if n < pivot :
20
+ smaller .append (n )
21
+ elif n == pivot :
22
+ equal .append (n )
23
+ else :
24
+ bigger .append (n )
25
+ return (quicksort (smaller )+ equal + quicksort (bigger ))
26
+
27
+ N_test = 10
28
+ test_lst = []
29
+ for i in range (N_test ):
30
+ test_lst .append (random .randint (0 ,100 ))
31
+
32
+ print ("Original list:" ,test_lst )
33
+ print ("Sorted list:" ,quicksort (test_lst ))
Original file line number Diff line number Diff line change
1
+ # -*- coding: utf-8 -*-
2
+ """
3
+ Created on Fri Jan 26 19:00:43 2018
4
+
5
+ @author: Tirtha
6
+ """
7
+ import random
8
+ def sort (array , start , end ):
9
+ if end > start :
10
+ pivot = array [start ]
11
+ middle = start + 1
12
+ for i in range (start + 1 , end ):
13
+ if array [i ] > array [middle ]:
14
+ tmp = array [i ]
15
+ array [i ] = array [middle ]
16
+ array [middle ] = tmp
17
+ middle += 1
18
+ sort (array , start , middle )
19
+ sort (array , middle , end )
20
+
21
+ N_test = 10
22
+ test_lst = []
23
+ for i in range (N_test ):
24
+ test_lst .append (random .randint (0 ,100 ))
25
+
26
+ print ("Original list:" ,test_lst )
27
+ sort (test_lst ,0 ,9 )
28
+ print ("Sorted list:" ,test_lst )
You can’t perform that action at this time.
0 commit comments