πŸ“Š Design and Analysis of Algorithms
Q. Which of the following sorting algorithm has best case time complexity of O(n2)?
  • (A) bubble sort
  • (B) selection sort
  • (C) insertion sort
  • (D) stupid sort
πŸ’¬ Discuss
βœ… Correct Answer: (B) selection sort

Explanation: selection sort is not an adaptive sorting algorithm. it finds the index of minimum element in each iteration even if the

Explanation by: Mr. Dubey
selection sort is not an adaptive sorting algorithm. it finds the index of minimum element in each iteration even if the

πŸ’¬ Discussion

Related MCQs

Q. The capacity relationship is given by

Q. ______________ is data about data.

Q. Communication offered by TCP is ________

Q. The mass used to balance the mass defect is known as ______

Q. Adding an intermediate component between two interacting modules in an application will improve:

Q. A special unit used to govern the out of order execution of the instructions is called as

Q. Which of the following SaaS platform is with an exposed API?

Q. The situation where the lock waits only for a specified amount of time for another lock to be released is

Q. The property (or set of properties) that uniquely defines each row in a table is called the:

Q. A collective communication in which data belonging to a single process is sent to all of the processes in the communicator is called a _________.

πŸ“Š Question Analytics

πŸ‘οΈ
248
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
93%
Success Rate