Loading lesson path
DSA
Arrays focused on DSA Arrays and related concepts.
An array is a data structure used to store multiple elements.
Bubble Sort is an algorithm that sorts an array from the lowest value to the highest value.
The Selection Sort algorithm finds the lowest value in an array and moves it to the front of the array.
The Insertion Sort algorithm uses one part of the array to hold the sorted values, and the other part of the array to hold values that are not sorted yet.
As the name suggests, Quicksort is one of the fastest sorting algorithms.
The Counting Sort algorithm sorts an array by counting the number of times each value occurs.
The Radix Sort algorithm sorts an array by individual digits, starting with the least significant digit (the rightmost one).
The Merge Sort algorithm is a divide-and-conquer algorithm that sorts an array by first breaking it down into smaller arrays, and then building the array back together the correct way so that it is s…
The Linear Search algorithm searches through an array and returns the index of the value it searches for.
The Binary Search algorithm searches through an array and returns the index of the value it searches for.