Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
63 changes: 62 additions & 1 deletion sorting.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
import os

import csv
import numpy

def read_data(file_name):
"""
Expand All @@ -10,9 +11,69 @@ def read_data(file_name):
"""
cwd_path = os.getcwd()
file_path = os.path.join(cwd_path, file_name)
with open(file_path, "r") as csv_file:
reader = csv.DictReader(csv_file)
data = {}
for row in reader:
for header, value in row.items():
if header not in data:
data[header] = [int(value)]
else:
data[header].append(int(value))

return data

def selection_sort(number_array, direction="ascending"):
sorted_array = []
i = 0
while i < len(number_array):
if direction == "ascending":
sorted_array.insert(i,max(number_array))
number_array.remove(max(number_array))
elif direction == "descending":
sorted_array.insert(i,min(number_array))
number_array.remove(min(number_array))
else:
print("chyba")

return sorted_array

def bubble_sort(number_array):
medium_list = []
i = 0
while i + 1 < len(number_array):
if number_array[i] > number_array[i+1]:
medium_list = [number_array[i]]
number_array[i] = number_array[i+1]
number_array[i + 1] = medium_list[0]
medium_list = []
i += 1
else:
i += 1
return number_array

def insertion_sort(number_array):
j = 0
for i in range(len(number_array)):
while i+1 < len(number_array):
if number_array[i] > number_array[i+1]:
number_array[i], number_array[i+1] = number_array[i+1],number_array[i]
if i > 0:
i -= 1
else:
j += 1
i = j

return number_array

def main():
data = read_data("numbers.csv")
print(data)

print(insertion_sort(data["series_2"]))
#print(selection_sort(data["series_1"]))
#print(selection_sort(data["series_2"],"descending"))
#print(selection_sort(data["series_3"]))
pass


Expand Down