>Algorithms

Found 2 QuestionsSET DEFAULT

Selected Filters

Exams

CUET (PG)

Subjects

Algorithms
Computer Science and IT Engineering
Data Science and Artificial Intelligence

Topics

Sorting
Algorithm design techniques
Asymptotic Notation - Comparing Growth Rates of Functions
Asymptotic worst case time and space complexity
Dynamic Programming - Computation Order and Correctness of Iterative Recurrence Evaluation
Graph Algorithms - Shortest Paths with Bounded Edges (Bellman-Ford Theory)
Graph Coloring and Bipartiteness
Graph Theory - Vertex Cover and NP-Completeness
Graph traversals
Hashing
Merge Sort
Minimum spanning trees
Recurrence Relations: Master Theorem
Searching
Shortest Paths
Shortest paths
Sorting
Time Complexity Analysis

List of top Algorithms Questions on Sorting

The average case complexity of Selection sort, Quick sort and Radix sort is respectively

CUET (PG) - 2023
CUET (PG)
Algorithms
Sorting

Consider the following array:
\[ 23 32 45 69 72 73 89 97 \] Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort the above array in ascending order?

GATE CS - 2021
GATE CS
Algorithms
Sorting