Data Structure › Time Complexity › Question #15253
MCQ Single Best Answer Easy

QWhat is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case?

ID: #15253 Time Complexity 175 views
Question Info
#15253Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(1) ✔ ✖
  • B O(log n) ✔ ✖
  • C O(n) ✔ ✖
  • D O(n^2) ✔ ✖
Correct Answer: Option D

Explanation

Selection sort is a simple comparison-based sorting algorithm that repeatedly selects the smallest element from the unsorted part of the array and swaps it with the element at the beginning of the unsorted part. In the worst case, for each pass of the algorithm, the smallest remaining element needs to be found by iterating through the unsorted part. This requires n-1 comparisons in the first pass, n-2 in the second pass, and so on, resulting in a quadratic time complexity of O(n^2).

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of a depth-first search (DFS) algorithm on a directed acyclic graph (DAG) with V v What is the time complexity of a merge sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a selection sort algorithm for sorting an array of n elements in the worst case What is the time complexity of a delete operation in a binary heap in the worst case? What is the time complexity of a bubble sort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a linear search algorithm for an unsorted array of n elements in the worst case What is the time complexity of a depth-first search (DFS) algorithm on a graph with V vertices and E edges? What is the time complexity of a quicksort algorithm for sorting an array of n elements in the worst case? What is the time complexity of a binary search algorithm for finding an element in a sorted array of n element What is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices