repl.it
@pieromqwerty/

sorting algorithm demo

Python

No description

fork
loading
Files
  • main.py
main.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
from os import system, name 
from time import sleep 

def clear(): 
    if name == 'nt': 
        _ = system('cls')
    else:
        _ = system('clear')

def sortTwo(a, b):
	if (a > b):
		return b, a
	else:
		return a, b

array = [4, 5, 6, 2, 7, 1, 5, 2, 5, 8, 9, 5, 9, 0, 3]

x = 0
while (x == 0):
	#yeet
?