Algorithms

Which concept is defined as follows: a search algorithm that checks each element in a list sequentially until the target value is found?
What is Linear search primarily used for?
The following statement describes a specific concept. What is it called? a measure of the amount of memory an algorithm uses as a function of input size.
Select the accurate description of Space complexity.
Which term refers to an algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights?
What does Bellman-Ford algorithm refer to?
What is the name for a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight?
Which of the following best describes Kruskal's algorithm?
Identify the correct concept described as: an ordering of vertices in a directed acyclic graph such that for every edge, the source vertex comes before the destination vertex.
Topological sort is best defined as which of the following?
A method of analyzing algorithms that determines the average time or space cost over a sequence of operations. What is this concept called?
Choose the correct description of Amortized analysis.
Which of the following best names the concept in which an optimization technique that stores the results of expensive function calls to avoid recomputing them?
What is the function or purpose of Memoization?
The concept in which a property of a sorting algorithm where elements with equal keys retain their original relative order is best known as which of these terms?
Identify the correct definition of Sorting stability.
What term describes the following? a straightforward problem-solving approach that tries all possible solutions to find the correct one.
In computer science, Brute-force algorithm refers to which of the following?
Select the correct name for: an algorithm that uses a degree of randomness as part of its logic to achieve good average-case performance.
The concept in which a sorting algorithm that builds the final sorted array one element at a time by inserting each element into its correct position is best known as which of these terms?