Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/crizstian/data-structure-and-algorithms-with-ES6
Data Structures and Algorithms using ES6
https://github.com/crizstian/data-structure-and-algorithms-with-ES6
algorithm data-structures es6 javascript search-algorithm sorting-algorithms
Last synced: 15 days ago
JSON representation
Data Structures and Algorithms using ES6
- Host: GitHub
- URL: https://github.com/crizstian/data-structure-and-algorithms-with-ES6
- Owner: crizstian
- Created: 2016-11-06T22:12:33.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2020-01-09T12:15:18.000Z (almost 5 years ago)
- Last Synced: 2024-11-28T02:41:59.211Z (24 days ago)
- Topics: algorithm, data-structures, es6, javascript, search-algorithm, sorting-algorithms
- Language: JavaScript
- Homepage:
- Size: 73.2 KB
- Stars: 1,036
- Watchers: 30
- Forks: 303
- Open Issues: 5
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Data Structures and Algorithms with ES6
 
## Examples in this repo
| **Num** | **Type** | **Exercises** | **Description** |
--- | --- | --- | ---
| 1.- | [Array](./02-chapter-Array) | 4 | The `Array` is the most common data structure in computer programming
| 2.- | [Lists](./03-chapter-List.js) | 5 | A `List` is an ordered sequence of data, where elements are not meant to be ordered.
| 3.- | [Stacks](./04-chapter-Stack) | 3 | A `Stack` is an example of Last-in, First-Out (LIFO)
| 4.- | [Queues](./05-chapter-Queue) | 2 | A `Queue` is an example of First-in, First-Out (FIFO)
| 5.- | [Linked List](./06-chapter-Linked-Lists-types) | 4 | A `Linked list` is a collection of objects called nodes. Each node is linked to a successor node in the list using an object reference.
| 6.- | [Double Linked List](./06-chapter-Linked-Lists-types) | 3 | Traversing a `Double linked list` are more efficient, since we no longer have to search for the previous node.
| 7.- | [Circular Linked List](./06-chapter-Linked-Lists-types) | 4 | The reason you might want to create a `Circular linked list` is if you want the ability to go backward through a list but don’t want the extra overhead of creating a doubly linked list.
| 8.- | [Hashing](./08-chapter-Hashing.js) | 2 | `Hashing` is a common technique for storing data in such a way that the data can be inserted and retrieved very quickly. Hashing uses a data structure called a hash table. Although hash tables provide fast insertion, deletion, and retrieval, they perform poorly for operations that involve searching.
| 9.- | [Binary Trees and Binary Search Trees](./10-chapter-Binary-Tree) | 4 | `Binary trees` are chosen over other more primary data structures because you can search a binary tree very quickly (as opposed to a linked list, for example) and you can quickly insert and delete data from a binary tree (as opposed to an array).
| 10.- | [Graph Data Structure](./11-chapter-Graphs) | 2 | A graph consists of a set of vertices and a set of edges. A map is a type of graph where each town is a vertex, and a road that connects two towns is an edge. Edges are defined as a pair (v1, v2), where v1 and v2 are two vertices in a graph
| 11.- | [Sorting Algorithms](./12-chapter-Sorting-Algorithms) | 6 | Two of the most common operations performed on data stored in a computer are sorting and searching.
| 12.- | [Searching Algorithms](./13-chapter-Searching-Algorithms) | 6 | There are two ways to search for data in a list: sequential search and binary search. A sequential search is used when the items in a list are in random order; a binary search is used when the items in a list are in sorted order.
### To run the examples we need the following:
- NodeJS Installed
- Open Any Terminal and position it to the folder where the files are located
- execute the tests: `$ npm install` then `node_modules/.bin/qunit -t path/test.js -c path/tests.js`
### References
- [Data Structures and Algorithms with JavaScript](http://shop.oreilly.com/product/0636920029557.do)
- [7 algorithms and data structures every programmer must know](https://codingsec.net/2016/03/7-algorithms-data-structures-every-programmer/)
Some exercises are based from the book [Data Structures and Algorithms with JavaScript](http://shop.oreilly.com/product/0636920029557.do) - [by Michael McMillian (O’Reilly)](http://www.oreilly.com/pub/au/518) ISBN - 978-1-449-36493-9.