https://github.com/turingschool/data_structures_and_algorithms

https://github.com/turingschool/data_structures_and_algorithms

Last synced: 3 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/turingschool/data_structures_and_algorithms
• Owner: turingschool
• Created: 2013-11-23T05:53:57.000Z (almost 11 years ago)
• Default Branch: master
• Last Pushed: 2017-05-16T17:03:19.000Z (over 7 years ago)
• Last Synced: 2024-04-24T09:03:36.690Z (7 months ago)
• Language: JavaScript
• Size: 3.17 MB
• Stars: 70
• Watchers: 30
• Forks: 198
• Open Issues: 1
• Metadata Files:
  • Readme: README.markdown

Awesome Lists containing this project

README

        
## Data Structures & Algorithms

In the process of becoming or practicing as a web application developer, it's easy to lose sight of Computer Science.

This collection of exercises and experiments seeks to help you build an understanding of those foundations.

## Local Setup

- Fork this repo

- Clone your forked repo

- `cd data_structures_and_algorithms`

- Set the remote

  - `git remote add upstream https://github.com/turingschool/data_structures_and_algorithms.git`

  

If there have been changes to this main repo - you can pull them down in the following way

- Make sure you are on a master branch, with no uncommitted work (makes this easier)

- `git fetch upstream master`

### Included Topics

* binary trees - README|Ruby|JavaScript

* Pathfinding Algorithm with A* - README|Ruby?

* luhn algorithm (checksumming) - README|Ruby

* graphs - README

* linked lists - README|Ruby|JavaScript

* bloom filters - README

* Hash Array Mapped Trie - README

* Hash Maps - README

* Heaps - README

* Huffman Coding - README|JavaScript

* MD5 Hashing - README|Ruby

* Red/Black Trees - README

* SHA-1 - README

* tries - README

#### To-Do / Would like to cover

* Skip Lists

* Persistent Data Structures

* Tries (more detail)

* Hashing algorithm implementation (maybe start with MurmurHash?)

* Dungeon Generation