Question

What is the worst case complexity of selection sort?

a.

O(nlogn)

b.

O(logn)

c.

O(n)

d.

O(n^2)

Posted under Data Structures and Algorithms

Answer: (d).O(n^2)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the worst case complexity of selection sort?

Add Comment

Similar Questions

Discover Related MCQs

Q. What is the advantage of selection sort over other sorting techniques?

View solution

Q. What is the average case complexity of selection sort?

View solution

Q. What is the disadvantage of selection sort?

View solution

Q. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,

View solution

Q. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,

View solution

Q. What is the best case complexity of selection sort?

View solution

Q. What is an external sorting algorithm?

View solution

Q. What is an internal sorting algorithm?

View solution

Q. What is the worst case complexity of bubble sort?

View solution

Q. What is the average case complexity of bubble sort?

View solution

Q. What is the advantage of bubble sort over other sorting techniques?

View solution

Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

View solution

Q. What is the best case efficiency of bubble sort in the improvised version?

View solution

Q. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?

View solution

Q. QuickSort can be categorized into which of the following?

View solution

Q. What is the worst case complexity of QuickSort?

View solution

Q. What is a randomized QuickSort?

View solution

Q. What is the best case complexity of QuickSort?

View solution

Q. The given array is arr = {2,3,4,1,6}. What are the pivots that are returned as a result of subsequent partitioning?

View solution

Q. What is the average case complexity of QuickSort?

View solution

View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...