https://github.com/rafaelbroseghini/advanced-algorithms-and-data-structures

:evergreen_tree: Arrays, Recursion, Hashing, Sets, Maps, Trees, Heaps, Graphs, Bloom Filter, Trie
https://github.com/rafaelbroseghini/advanced-algorithms-and-data-structures

Last synced: 16 days ago
JSON representation

:evergreen_tree: Arrays, Recursion, Hashing, Sets, Maps, Trees, Heaps, Graphs, Bloom Filter, Trie

• Host: GitHub
• URL: https://github.com/rafaelbroseghini/advanced-algorithms-and-data-structures
• Owner: RafaelBroseghini
• Created: 2018-08-25T19:21:09.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2018-12-12T02:58:30.000Z (about 6 years ago)
• Last Synced: 2024-10-22T09:59:48.854Z (2 months ago)
• Language: Python
• Homepage:
• Size: 405 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Advanced Algorithms and Data Structures :evergreen_tree:

## Overview:

This repo is a collection of exercises/problems using implementation from scratch of well know data structures and algorithms. It is pretty awesome to implement these data types from scratch and analyze their computational complexity of iteration, lookup, removal, etc. In this sense, pondering trade-offs between time and space has also been a key part in the my designing process.

## Data Structures:

* **HashSet.**

* **HashMap.**

* **Ordered Tree Set.**

  * **Binary Search Tree.**

* **Priority Queue as a Heap** 

* **Bloom Filter**

* **Trie**

* **AVL Tree**

* **B-Tree (All in memory)**

## Notes:

* Can we achieve O(1) time complexity for building; lookup; removal; insert; etc... (Data Structure utopia)?

* Yes? We have built the best DS!

* No?

  * Choose a different Data Structure. :joy: