FilesExpand file tree

 master

/

quick_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

14 lines (13 loc) · 484 Bytes

 master

/

quick_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

14 lines (13 loc) · 484 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

"""

Here is the implementation of quicksort algorithm in python by Pramod Bharti

quick_sort() function takes an unsorted array and prints sorted array

"""

def quick_sort(arr):

if len(arr) <= 1:

return arr

pivot = arr[len(arr) // 2]

left = [x for x in arr if x < pivot]

middle = [x for x in arr if x == pivot]

right = [x for x in arr if x > pivot]

return quick_sort(left) + middle + quick_sort(right)

print (quick_sort([5,2,8,3,9,12,43])) # This will print [2,3,5,8,9,12,43]