def test_quick_sort_simple_odd(self):
arr = [5, 4, 3, 2, 1]
arr_copy = arr[::]
arr_copy.sort()
quick_sort(arr, 0, len(arr) - 1),
self.assertEqual(arr, arr_copy)
def test_quick_sort(self):
self.assertEqual([1, 5, 23, 57, 65, 1232],
quick_sort([1, 5, 65, 23, 57, 1232]))
print(my_list[:10])
eot = time.perf_counter()
print("Total run time for insertion sort",eot-sot)
# selection sort
my_list = [randint(0, 1000) for i in range(ARRAY_LENGTH)]
print(my_list[:10])
sot = time.perf_counter()
my_list = selection_sort(my_list)
eot = time.perf_counter()
print("Total run time for selection sort",eot-sot)
print(my_list[:10])
# quick sort
my_list = [randint(0, 1000) for i in range(ARRAY_LENGTH)]
print(my_list[:10])
sot = time.perf_counter()
my_list = quick_sort(my_list)
eot = time.perf_counter()
print("Total run time for quick sort",eot-sot)
print(my_list[:10])
# bubble sort
my_list = [randint(0, 1000) for i in range(ARRAY_LENGTH)]
print(my_list[:10])
sot = time.perf_counter()
my_list = bubble_sort(my_list)
eot = time.perf_counter()
print("Total run time for bubble sort",eot-sot)
print(my_list[:10])
# shell sort
my_list = [randint(0, 1000) for i in range(ARRAY_LENGTH)]
print(my_list[:10])
sot = time.perf_counter()
def test_quick_sort(self):
self.assertTrue(is_sorted(quick_sort([1, 3, 2, 5, 65, 23, 57, 1232])))
from algorithms.sort import quick_sort import random alist=[random.randint(1,100) for i in range(100)] print(alist) sorted_list=quick_sort(alist,simulation=False) print(sorted_list)
from algorithms.sort import (bucket_sort, next_sort, quick_sort) print(bucket_sort([1, 2, 3, 7, 8, 9, 4, 5, 6, 1, 1, 2])) print(quick_sort([1, 2, 3, 7, 8, 9, 4, 5, 6, 1, 1, 2]))
def test_quick_sort(self):
self.assertEqual([1, 5, 23, 57, 65, 1232],
quick_sort([1, 5, 65, 23, 57, 1232]))
def test_quick_sort_large(self):
arr = random.sample(range(500), 500)
arr_copy = arr[::]
arr_copy.sort()
quick_sort(arr, 0, len(arr) - 1),
self.assertEqual(arr, arr_copy)
# Design and Analysis of Data Structures and Algorithms
import random
from algorithms.sort import bubble_sort, selection_sort, insertion_sort, merge_sort, quick_sort
numbers = random.sample(range(100, 999), 25)
print("Unsorted List")
print(numbers)
print("Bubble Sort")
bs = bubble_sort(numbers)
print(bs)
print("Selection Sort")
ss = selection_sort(numbers)
print(ss)
print("Insertion Sort")
ins = insertion_sort(numbers)
print(ins)
print("Merge Sort")
ms = merge_sort(numbers)
print(ms)
print("Quick Sort")
qs = quick_sort(numbers)
print(qs)
def main():
data = [5, 4, 3, 2, 1]
quick_sort(data)
print(data)
