A collection of data structures and algorithms implemented in Python and JavaScript.

Contents

• Data Structures
  • Tree
• Algorithms 🚧
  • Tree Traversal
  • Sorting
  • Searching
  • Graph problems
  • Sets
  • Strings
• Algorithm Designs and Techniques 🚧
  • Divide and conquer
  • Dynamic programming
  • Greedy algorithms
• Analysis of Algorithms 🚧
  • Asymptotic Notation
  • Comparing complexities
  • NP-completeness theory

🚧 denotes section is WIP

Data Structures

In computer science, a data structure is a data organization, management and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. — Wikipedia

Name	Description
Tree	non-linear data structure that simulates a hierarchical tree structure

Algorithms

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems. "A set of rules that precisely defines a sequence of operations." — Wikipedia

Tree Traversal

Name	Description
Depth-First Search (DFS)	algorithm for searching or traversing tree or graph data structures
Breadth-First Search (BFS)	algorithm for searching or traversing tree or graph data structures

Strings

Name	Description
Knuth-Morris-Pratt (KMP)	string-searching algorithm

Algorithm Designs and Techniques

Divide and conquer

Dynamic programming

Greedy algorithms

---

References:

The Algorithm Design Manual — Steven Skiena
Introduction to Algorithms — Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
Learning JavaScript Data Structures and Algorithms — Loiane Groner
JavaScript Algorithms — Oleksii Trekhleb

↑ 👋