Instantly share code, notes, and snippets.

# anirudhjayaraman/quicksort.py

Last active February 3, 2021 20:01
Python code for the Quick Sort Algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 def quicksort(x): if len(x) == 1 or len(x) == 0: return x else: pivot = x[0] i = 0 for j in range(len(x)-1): if x[j+1] < pivot: x[j+1],x[i+1] = x[i+1], x[j+1] i += 1 x[0],x[i] = x[i],x[0] first_part = quicksort(x[:i]) second_part = quicksort(x[i+1:]) first_part.append(x[i]) return first_part + second_part alist = [54,26,93,17,77,31,44,55,20] quicksort(alist) print(alist)

### CcGaviria commented Jun 30, 2019 • edited

Bueno pues la razón de que no funcione es que no estamos teniendo en cuenta el tipo de dato que comparamos:
The data type is not integer...

`def sort(num):`
`if len(num) < 2:`
`return num`
`else:`
`piv = int(num[0])`
`less = [x for x in num[1:] if int(x) < piv]`
`print("less",less)`
`higher = [x for x in num[1:] if int(x) > piv]`
`print(higher)`
`return sort(higher) + [piv] + sort(less)`
`for y in range(0, input()):`
`list = raw_input()`
`alist = list.split()`
`listOrg = sort(alist)`
`print(listOrg)`

### anandrajB commented Jan 24, 2020

simple method

a= [4,7,1,2,3,9,7,0,4,56,3]
for i in range(len(a)):
for j in range(len(a)):
if a[i]<a[j]:
a[i],a[j]=a[j],a[i]
print("The sorted list is ",a)

### RaviPabari commented Aug 19, 2020

@pete312 use pypy3 instead of python to see some BIG RUNNING TIME DIFFRENCE