Sorting
This sorting algorithm repeatedly selects the smallest element from an unsorted portion and swaps it with the first unsorted element.
What is Selection Sort?
This is the time complexity of Binary Search in a sorted array.
What is O(logn)?
This is a collection of vertices and edges, where each edge connects exactly two vertices.
What is a graph?
This algorithm finds an item by checking every element in a list one by one.
What is Linear Search?
This is a function that calls itself in order to solve a problem.
What is recursion?
This sorting algorithm repeatedly compares adjacent elements and swaps them if they are in the wrong order, continuing this process until the entire list is sorted.
What is Bubble Sort?
This time complexity is for a nested loop where each loop runs n times.
What is O(n2)?
This type of graph has no edges connecting vertices in a cycle, meaning no vertex is connected back to itself.
What is an Acyclic Graph?
This search algorithm only works on sorted lists and repeatedly divides the search interval in half.
What is Binary Search?
In recursion, this condition ensures the function stops calling itself and avoids running indefinitely.
What is the base case?
This algorithm splits the array into smaller subarrays, sorts them, and then merges them back together in sorted order.
What is Merge Sort?
This time complexity is common in efficient sorting algorithms like Merge Sort and Quick Sort.
What is O(nlogn)?
This is a graph where the edges have a direction, meaning they point from one vertex to another.
What is a Directed Graph?
This is the process of locating an item in an array by repeatedly halving the portion of the array that could contain the item.
What is the main idea behind Binary Search?
This is a classic recursive problem where the function calculates the factorial of a number, which is the product of all positive integers up to that number.
What is the Factorial problem?
This algorithm works by selecting a 'pivot' element and partitioning the array into elements smaller and larger than the pivot, recursively sorting the subarrays.
What is Quick Sort?
This time complexity occurs in algorithms that check every element in the input once, like Linear Search
What is O(n)?
This algorithm involves finding the shortest path from one node to another in an unweighted graph.
What is Breadth-First Search (BFS)?
This search technique is the opposite of binary search and works by checking every element in a list in sequence.
What is Linear Search?
In this problem, the goal is to compute the nth Fibonacci number, where each number is the sum of the two preceding ones.
What is the Fibonacci sequence?
This sorting algorithm is very efficient for large datasets and uses a divide-and-conquer approach. Its worst-case time complexity is O(nlogn).
What is Merge Sort?
This time complexity is associated with algorithms that check every possible solution, such as brute force approaches, and is considered the least efficient.
What is O(2n)?
A graph in which the edges do not have direction, meaning the edges are bidirectional.
What is an Undirected Graph?
This term refers to an array or list being arranged in a specific order, making certain search algorithms, like Binary Search, more efficient.
What is a Sorted List?
This recursive problem asks for the solution to a problem by breaking it down into smaller subproblems, like solving the Tower of Hanoi puzzle.
What is the Tower of Hanoi?