master-algorithms-py/sorting at 4d2e7857b2a18cfc428fc87f02159cb7076900ea - master-algorithms-py - Gitea: Git with a cup of tea

Git-Mirrors/master-algorithms-py

mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00

History

marina 4d2e7857b2

Create counting_sort.py

2023-08-02 20:55:05 -07:00

..

bubble_sort.py

Create bubble_sort.py

2023-08-02 20:53:18 -07:00

counting_sort.py

Create counting_sort.py

2023-08-02 20:55:05 -07:00

insertion_sort.py

Create insertion_sort.py

2023-08-02 20:54:05 -07:00

README.md

Update README.md

2023-08-02 18:40:15 -07:00

seletction_sort.py

Create seletction_sort.py

2023-08-02 20:52:30 -07:00

sorting_algorithms.py

👾

2023-07-30 21:40:09 -07:00

README.md

sorting

inversions in a sequence is a pair of elements that are out of order with respect to the ordering relation. a sorting algorithm is a sequence of operations that reduces inversions to zero.
a topological sort of a diretect graph is a way of ordering the list of nodes such that if (a, b) is a edge of the graph, then a appears before b. it does not work if a graph has cycles or is not directed.

some examples in this dir

`sorting_algorithms.py`

> python3 sorting_algorithms.py


Array: [3, 5, 1, 2, 10, 6]
Testing merge sort: [1, 2, 3, 5, 6, 10]
Testing quick sort: [1, 2, 3, 5, 6, 10]

`binary_search.py`

> python binary_search.py
Recursive:  6
Iterative:  6