Gain insights into efficient algorithm creation with JavaScript. Delve into data structures and sorting algorithms, including Trees, Graphs, Heaps, and Linked lists, optimizing space and time.

Are you ready to become a top-notch JavaScript developer? Understand two of the most important concepts in programming - Data Structures & Sorting Algorithms.

Learn to make efficient algorithms that save space and time if you want to excel in the field of software development. Take this interactive course to find out how to employ the most effective data structure in any scenario. This course covers sorting algorithms and their time complexity using JavaScript along with various data structures like Trees, Graphs, Heaps, Linked lists  and many more.

Mastering Data Structures and Sorting Algorithms in JavaScript

To make a heap out of an array, we first need to go over all the items in the array, from right to left. This is necessary, as we start at the leaves. It receives the array we want to sort, and invokes the function that makes a heap on every element. 

function makeHeap(arr) {
  const n = arr.length;
  for (let i = Math.floor(n / 2) - 1; i >= 0; i--) {
    // Heapify function.
  }
}

The heapify function should receive the array, the length of the array, and the current index. In order to make the heap, this order is very important to remember:


If we have a *maximum heap*, the node with the highest value should be on top. Next, we have the left node, and the right node.

Big-O Notation

Data Structures

Stacks

Queues

Linked Lists

Binary Search Tree

Hash Table

Graphs

Sorting Algorithms

Bubble Sort

Insertion Sort

Merge Sort

Quicksort

Selection Sort

Counting Sort

Bucket Sort

Radix Sort

Heap Sort

Heap Sort (Implementation)