-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuicksort.py
More file actions
52 lines (48 loc) · 1.26 KB
/
Quicksort.py
File metadata and controls
52 lines (48 loc) · 1.26 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# Quicksort.py
#
# Copyright 2016 Yorlys Oropeza <yorlys@debian>
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
# MA 02110-1301, USA.
#
#
lista = [4,3,1,5,2,6,8]
print (lista)
j = len(lista)-1
i = 0
def quicksort(lista,i,j):
fin = j
inicio = i
pivote = lista[i]
while i <= j:
while lista[i] < pivote:
i = i+1
while lista[j] > pivote:
j = j-1
if i <= j:
aux = lista[i]
lista[i] = lista[j]
lista[j] = aux
i = i+1
j = j-1
if inicio < j:
quicksort(lista,inicio,j)
if i < fin:
quicksort(lista,i,fin)
quicksort(lista,i,j)
print (lista)