Data Structure › Time Complexity › Question #15272
Single Choice Easy

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

ID: #15272 Time Complexity 200 views
Question Info
#15272Q 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

Explanation

Selection sort is an in-place comparison-based sorting algorithm that repeatedly selects the minimum or maximum element and places it in the sorted portion of the array. In the worst case, selection sort requires nested iterations, comparing each element with the remaining unsorted portion. This results in a quadratic time complexity of O(n^2).

 Continue Practice
Previous Question No Next
 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 delete operation in a binary heap 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 bubble sort 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 linear search algorithm for an unsorted array of n elements in the worst case What is the time complexity of a topological sort algorithm on a directed acyclic graph (DAG) with V vertices 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 depth-first search (DFS) algorithm on a graph with V vertices and E edges?