mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-27 17:06:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update: algorithm import way

Browse Source
This commit is contained in:
Jeonghyun Min 2024-11-07 08:15:08 +08:00
parent 4c8c9da9ed
commit 4c78b50509
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
sorts/stopwatch_sort.py
View File

@ -16,15 +16,15 @@ takes to complete the sorting process.
import random import random
import time import time
from binary_insertion_sort import binary_insertion_sort from sorts.binary_insertion_sort import binary_insertion_sort
from bubble_sort import bubble_sort_iterative from sorts.bubble_sort import bubble_sort_iterative
from bucket_sort import bucket_sort from sorts.bucket_sort import bucket_sort
from counting_sort import counting_sort from sorts.counting_sort import counting_sort
from heap_sort import heap_sort from sorts.heap_sort import heap_sort
from merge_sort import merge_sort from sorts.merge_sort import merge_sort
from quick_sort import quick_sort from sorts.quick_sort import quick_sort
from radix_sort import radix_sort from sorts.radix_sort import radix_sort
from selection_sort import selection_sort from sorts.selection_sort import selection_sort
def stopwatch_sort(func_list: list, number_of_integers: int = 10000) -> list: def stopwatch_sort(func_list: list, number_of_integers: int = 10000) -> list: