trekhleb /
javascript-algorithms
๐ Algorithms and data structures implemented in JavaScript with explanations and links to further readings
Loading repository dataโฆ
kokoforbes / repository
๐ Algorithms and data structures implemented in JavaScript with explanations and links to further readings
| Num | Type | Description |
|---|---|---|
| 1.- | Big O Notation | BIG O is use to classify algorithms according to how their run time or space requirements grow as the input size grows |
| 2.- | Array | The Array is the most common data structure in computer programming |
| 3.- | Hash Table | 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. |
| 4.- | Linked List | 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 |
| 5.- | Stack | A Stack is an example of Last-in, First-Out (LIFO) |
| 6.- | Queue | A Queue is an example of First-in, First-Out (FIFO) |
| 7.- | Tree | 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). |
| 8.- | Graph | 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. |
| 9.- | Recursion | Recursion |
| 10.- | Sorting | Two of the most common operations performed on data stored in a computer are sorting and searching. |
| 11.- | Searching | 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. |
Selected from shared topics, language and repository descriptionโnot editorial ratings.
trekhleb /
๐ Algorithms and data structures implemented in JavaScript with explanations and links to further readings
fuzhengwei /
๐ Java ๆฐๆฎ็ปๆๅ็ฎๆณ | Algorithms and data structures implemented in Java with explanations and links to further readings
Rustam-Z /
๐ Notes on Data Structures and Computer Algorithms
devparthgarg /
๐ Algorithms and data structures implemented in C++
elianalopez /
๐ Data Structures and Algorithms in Python, with explanations!
sahilsehwag /
Python implementation of "A Fuzzy K-nearest Neighbor Algorithm by J.M Keller, M.R. Grey and J.A. Givens" ๐