Request New Subject
Home
Computer Science Engineering (CSE)
Design and Analysis of Algorithms
Q. Which of the following sorting algorithm has best case time complexity of O(n2)? (Solved)
1. bubble sort
2. selection sort
3. insertion sort
4. stupid sort
b. selection sort
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe