Back To Course Home

Mastering Data Structures and Sorting Algorithms in JavaScript

0% completed

Big-O Notation

Introduction to Time Complexity - Big O Constant Complexity - O(1)Linear Complexity - O(n)Quadratic Complexity - O(n^2)Logarithmic Complexity - O(log(n))Exponential Complexity - O(2^n)

Data Structures

Introduction to Data Structures

Stacks

Introduction to Stacks Stacks (Implementation)Stacks (Time Complexity)

Queues

Introduction to Queues Queues (Implementation)Queues (Time Complexity)

Linked Lists

Singly Linked List Singly Linked List (Implementation)Doubly Linked List Doubly Linked List (Implementation)Linked List (Time Complexity)

Binary Search Tree

Introduction to Binary Search Tree Binary Search Tree (Implementation)Insertion in Binary Search Tree Deletion in Binary Search Tree Traversing a Binary Search Tree Depth First Traversal Breadth-first Traversal Binary Search Tree (Time Complexity)

Hash Table

Introduction to Hash Table Hash Table (Implementation)Hash Table (Time Complexity)

Graphs

Introduction to Graphs Graphs (Implementation)Graphs (Depth-first traversal)Graphs (Breadth-first traversal)

Sorting Algorithms

Introduction to Sorting Algorithms

Bubble Sort

Introduction to Bubble Sort Bubble Sort (Implementation)Bubble Sort (Time Complexity)

Insertion Sort

Introduction to Insertion Sort Insertion Sort (Implementation)Insertion Sort (Time Complexity)

Merge Sort

Introduction to Merge Sort Merge Sort (Implementation)Merge Sort (Time Complexity)

Quicksort

Introduction to Quicksort Quicksort (Implementation)Quicksort (Time Complexity)

Selection Sort

Introduction to Selection Sort Selection Sort (Implementation)Selection Sort (Time Complexity)

Counting Sort

Introduction to Counting Sort

Counting Sort (Implementation)

Counting Sort (Time Complexity)

Bucket Sort

Introduction to Bucket Sort Bucket Sort (Implementation)Bucket Sort (Time Complexity)

Radix Sort

Introduction to Radix Sort Radix Sort (Implementation)Radix Sort (Time Complexity)

Heap Sort

Introduction to Heap Sort Heap Sort (Implementation)Heapsort (Time Complexity)

Counting Sort (Implementation)

(Reading time: 3 minutes)

We create a function that takes 3 arguments: the array, the minimum value, and the maximum value. In the example above, the minimum value was 0, and the maximum value was 9.

Get hands-on with 1200+ tech skills courses.