Red Wood 7e904c8ff6 Update counting_sort.py (#1677) ...

Since the max function is called to find the maximum value, it doesn't seem necessary to traverse the list and call the max function several times to select the larger value.

2025-03-09 06:39:32 +08:00

..

bubble_sort.py

…

bucket_sort.py

Some improvements (#1073)

2024-02-07 22:21:18 +08:00

counting_sort.py

Update counting_sort.py (#1677)

2025-03-09 06:39:32 +08:00

heap_sort.py

Some improvements (#1073)

2024-02-07 22:21:18 +08:00

insertion_sort.py

…

merge_sort.py

[Rust] Normalize mid calculation in case overflow (#1363)

2024-05-18 18:19:19 +08:00

quick_sort.py

Fix the median_three mehod for quick sort (#1134)

2024-03-15 01:06:59 +08:00

radix_sort.py

Some improvements (#1073)

2024-02-07 22:21:18 +08:00

selection_sort.py

Some improvements (#1073)

2024-02-07 22:21:18 +08:00