Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/andersy005/algorithms

Data Structures and Algorithms implementations
https://github.com/andersy005/algorithms

algorithms data-structures python

Last synced: 19 days ago
JSON representation

Data Structures and Algorithms implementations

Host: GitHub
URL: https://github.com/andersy005/algorithms
Owner: andersy005
License: mit
Created: 2016-10-24T01:02:57.000Z (about 8 years ago)
Default Branch: master
Last Pushed: 2020-03-20T06:26:42.000Z (almost 5 years ago)
Last Synced: 2024-12-15T12:47:01.437Z (20 days ago)
Topics: algorithms, data-structures, python
Homepage:
Size: 1000 Bytes
Stars: 4
Watchers: 4
Forks: 1
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        # Algorithms

Data Structure and Algorithms implementations in Python

**Note**

This repository is meant to be used as a reference to learn data structures and algorithms in Python programming language.

**Documentation**

TODO

## Data structure

## TO DO

- Sorting Algorithms

  _ [Bubble Sort](https://en.wikipedia.org/wiki/Bubble_sort)

  _ [Selection Sort](https://en.wikipedia.org/wiki/Selection_sort)

  _ [Insertion Sort](https://en.wikipedia.org/wiki/Insertion_sort)

  _ [Merge Sort](https://en.wikipedia.org/wiki/Merge_sort)

  _ [Quick Sort](https://en.wikipedia.org/wiki/Quicksort)

  _ [Quick Select](https://en.wikipedia.org/wiki/Quickselect)

  _ [Shell Sort](https://en.wikipedia.org/wiki/Shellsort)

  _ [Heap Sort](https://en.wikipedia.org/wiki/Heapsort)

- [Stack (Array Implementation)]()

  _ Infix to Postfix

  _ Infix to Prefix \* Infix Evaluation

- [Queue (Array Implementation)]()

- LinkedList

  _ [Singly Linked List](https://en.wikipedia.org/wiki/Linked_list)

  _ [Doubly Linked List](https://en.wikipedia.org/wiki/Doubly_linked_list)

- [Shuffle (Using Fisher-Yates (Knuth) shuffling algorithm)](https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle)

- [Binary Search Tree](https://en.wikipedia.org/wiki/Binary_search_tree)

- [Binary Heap](https://en.wikipedia.org/wiki/Binary_heap)

  - Min Heap

  - Max Heap

- [Red Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)

- Search

  - [Binary Search](https://en.wikipedia.org/wiki/Binary_search_algorithm)

- Vertical Order Traversal of Tree

- Order Statistics of Tree

- Red Black Tree Deletion

- B-Tree

- Deque using circular array

- Tree Varient

- Graph Varient

- [cocktail sort](https://en.wikipedia.org/wiki/Cocktail_shaker_sort)

- [gnome sort](https://en.wikipedia.org/wiki/Gnome_sort)

- [comb sort](https://en.wikipedia.org/wiki/Comb_sort)

- [odd-even sort](https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort)

- [counting sort](https://en.wikipedia.org/wiki/Counting_sort)

## Contribution

Feel Free to contribute!