Insertion sort is a simple sorting algorithm suitable for small datasets that builds the final sorted array one item at a time, inserting elements into their correct position.
• Time complexity: O(n^2)
• Space complexity: O(1)
#AlgorithmReview
Bubble sort is a simple but inefficient sorting algorithm that repeatedly compares adjacent elements in a list, swapping them if they are out of order.
• Time complexity: O(n^2)
• Space complexity: O(1)
#AlgorithmReview
Shell sort is an optimization over insertion sort that sorts elements far apart from each other and progressively reduces the gap between elements to be compared.
• Time complexity: O(n log n) to O(n^2) depending on gap sequence
• Space complexity: O(1)
#AlgorithmReview
Knapsack Problem (0/1) is a dynamic programming algorithm for solving the knapsack problem that determines the maximum value that can be obtained without exceeding the weight capacity.
• Time complexity: O(nW)
• Space complexity: O(nW)
#AlgorithmReview
Binary Search is an efficient algorithm for finding an item from a sorted list that repeatedly divides the search interval in half until the target value is found.
• Time complexity: O(log n)
• Space complexity: O(1)
#AlgorithmReview
Radix sort is a non-comparative integer sorting algorithm that processes individual digits of numbers, starting from the least significant digit to the most significant.
• Time complexity: O(d * (n + k))
• Space complexity: O(n + k)
#AlgorithmReview
Heap sort (in-place) is a comparison-based sorting algorithm using a binary heap data structure that repeatedly removes the root (largest or smallest element depending on the heap type) and maintains the heap property.
• Time complexity: O(n log n)
• Space complexity: O(1)
#AlgorithmReview
Knapsack Problem (0/1) is a dynamic programming algorithm for solving the knapsack problem that determines the maximum value that can be obtained without exceeding the weight capacity.
• Time complexity: O(nW)
• Space complexity: O(nW)
#AlgorithmReview
Shell sort is an optimization over insertion sort that sorts elements far apart from each other and progressively reduces the gap between elements to be compared.
• Time complexity: O(n log n) to O(n^2) depending on gap sequence
• Space complexity: O(1)
#AlgorithmReview
Floyd-Warshall is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights that uses dynamic programming to update the shortest paths between all pairs of vertices.
• Time complexity: O(V^3)
• Space complexity: O(V^2)
#AlgorithmReview
Insertion sort is a simple sorting algorithm suitable for small datasets that builds the final sorted array one item at a time, inserting elements into their correct position.
• Time complexity: O(n^2)
• Space complexity: O(1)
#AlgorithmReview
Counting sort is a non-comparison-based sorting algorithm suitable for small, non-negative integer ranges that counts the occurrences of each element and uses this information to place elements in the correct position.
• Time complexity: O(n + k)
• Space complexity: O(k)
#AlgorithmReview
Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• Time complexity: O(V + E)
• Space complexity: O(V) but may vary depending on implementation
#AlgorithmReview
Heap sort (in-place) is a comparison-based sorting algorithm using a binary heap data structure that repeatedly removes the root (largest or smallest element depending on the heap type) and maintains the heap property.
• Time complexity: O(n log n)
• Space complexity: O(1)
#AlgorithmReview
Breadth-First Search (BFS) is a graph traversal algorithm that explores all neighbors at the current depth before moving on to nodes at the next depth level.
• Time complexity: O(V + E)
• Space complexity: O(V)
#AlgorithmReview
Shell sort is an optimization over insertion sort that sorts elements far apart from each other and progressively reduces the gap between elements to be compared.
• Time complexity: O(n log n) to O(n^2) depending on gap sequence
• Space complexity: O(1)
#AlgorithmReview
Heap sort (in-place) is a comparison-based sorting algorithm using a binary heap data structure that repeatedly removes the root (largest or smallest element depending on the heap type) and maintains the heap property.
• Time complexity: O(n log n)
• Space complexity: O(1)
#AlgorithmReview
Heap sort (in-place) is a comparison-based sorting algorithm using a binary heap data structure that repeatedly removes the root (largest or smallest element depending on the heap type) and maintains the heap property.
• Time complexity: O(n log n)
• Space complexity: O(1)
#AlgorithmReview
Radix sort is a non-comparative integer sorting algorithm that processes individual digits of numbers, starting from the least significant digit to the most significant.
• Time complexity: O(d * (n + k))
• Space complexity: O(n + k)
#AlgorithmReview
Bucket sort is a distribution sort that works well when input is uniformly distributed that divides the elements into several buckets, sorts each bucket, and then merges them.
• Time complexity: O(n + k)
• Space complexity: O(n + k)
#AlgorithmReview
Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• Time complexity: O(V + E)
• Space complexity: O(V) but may vary depending on implementation
#AlgorithmReview
Counting sort is a non-comparison-based sorting algorithm suitable for small, non-negative integer ranges that counts the occurrences of each element and uses this information to place elements in the correct position.
• Time complexity: O(n + k)
• Space complexity: O(k)
#AlgorithmReview
Bucket sort is a distribution sort that works well when input is uniformly distributed that divides the elements into several buckets, sorts each bucket, and then merges them.
• Time complexity: O(n + k)
• Space complexity: O(n + k)
#AlgorithmReview
Insertion sort is a simple sorting algorithm suitable for small datasets that builds the final sorted array one item at a time, inserting elements into their correct position.
• Time complexity: O(n^2)
• Space complexity: O(1)
#AlgorithmReview
Knapsack Problem (0/1) is a dynamic programming algorithm for solving the knapsack problem that determines the maximum value that can be obtained without exceeding the weight capacity.
• Time complexity: O(nW)
• Space complexity: O(nW)
#AlgorithmReview
Breadth-First Search (BFS) is a graph traversal algorithm that explores all neighbors at the current depth before moving on to nodes at the next depth level.
• Time complexity: O(V + E)
• Space complexity: O(V)
#AlgorithmReview
Radix sort is a non-comparative integer sorting algorithm that processes individual digits of numbers, starting from the least significant digit to the most significant.
• Time complexity: O(d * (n + k))
• Space complexity: O(n + k)
#AlgorithmReview
Counting sort is a non-comparison-based sorting algorithm suitable for small, non-negative integer ranges that counts the occurrences of each element and uses this information to place elements in the correct position.
• Time complexity: O(n + k)
• Space complexity: O(k)
#AlgorithmReview
Quick sort is a fast, divide-and-conquer sorting algorithm that selects a pivot element and partitions the list into sublists of elements less than and greater than the pivot.
• Time complexity: O(n^2) (worst), O(n log n) (average)
• Space complexity: O(log n)
#AlgorithmReview
Merge sort is an efficient, stable, divide-and-conquer sorting algorithm that recursively divides the list into halves, sorts each half, and merges them back together.
• Time complexity: O(n log n)
• Space complexity: O(n)
#AlgorithmReview
