https://github.com/friendly-banana/always-be-coding

https://github.com/friendly-banana/always-be-coding

Last synced: 8 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/friendly-banana/always-be-coding
• Owner: Friendly-Banana
• Created: 2020-08-04T09:23:47.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2022-11-22T11:50:04.000Z (about 2 years ago)
• Last Synced: 2024-11-07T10:31:19.064Z (about 2 months ago)
• Language: Python
• Size: 20.5 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Always Be Coding

a playground to implement common things

## Algorithmes

- [X] [Insertion sort, Selection sort, Merge Sort, Quicksort](/Algorithmes/SortTypes.py)

- [X] [Binary Search](/Algorithmes/BinarySearch.py)

- [ ] [Breadth First Search (BFS)](/Algorithmes/)

- [ ] [Depth First Search (DFS)](/Algorithmes/)

- [ ] [Lee algorithm | Shortest path in a Maze](/Algorithmes/)

- [ ] [Flood fill Algorithm](/Algorithmes/)

- [X] [Astar](/Algorithmes/astar.py)

- [X] [Astar Visualization](Algorithmes/astar_visual.py)

- [ ] [Floyd’s Cycle Detection Algorithm](/Algorithmes/)

- [ ] [Kadane’s algorithm](/Algorithmes/)

- [ ] [Longest Increasing Subsequence](/Algorithmes/)

- [ ] [Inorder, Preorder, Postorder Tree Traversals](/Algorithmes/)

- [ ] [Heap Sort](/Algorithmes/)

- [ ] [Topological Sorting in a DAG](/Algorithmes/)

- [ ] [Disjoint-Set Data Structure (Union-Find Algorithm)](/Algorithmes/)

- [ ] [Kruskal’s Algorithm for finding Minimum Spanning Tree](/Algorithmes/)

- [ ] [Single-Source Shortest Paths — Dijkstra’s Algorithm](/Algorithmes/)

- [ ] [All-Pairs Shortest Paths — Floyd Warshall Algorithm](/Algorithmes/)

## Data Structures

- [X] [List / Vector (dynamic array)](/Collections/List.cs)

- [X] [Linked List](/Collections/LinkedList.py)

- [X] [Set](/Collections/Set.py)

- [X] [Stack](/Collections/Stack.py)

- [X] [Queue](/Collections/Queue.py)

- [X] [Circular Queue](/Collections/CircularQueue.py)

- [X] [Priority Queue](/Collections/PriorityQueue.py)

- [X] [Binary Tree](/Collections/BinaryTree.py)