Answer-Which all statements are correct about Sorting

Question

Accepted Answer

Option 5 only b and d  Explanation    Bubble sort has On2 as best case time complexity   This statement is incorrect . The best case time complexity for Bubble Sort is On , which occurs when the array is already sorted. In such cases, Bubble Sort can detect the sorted array early and terminate.     Selection sort has On2 as best case time complexity   This statement is correct . Selection Sort always has a time complexity of On2 , regardless of the initial ordering of the elements. This is because it always goes through the entire list to find the minimum element for each position.     Insertion sort has On2 as best case time complexity   This statement is incorrect . The best case time complexity for Insertion Sort is On , which occurs when the array is already sorted. In such cases, each insertion requires only one comparison.     Radix sort has OnK as best case time complexity   This statement is correct . Radix Sort has a time complexity of Odn  k, where d is the number of digits in the largest number and k is the range of the digit base of the number system. In many cases, it is simplified to On  k if the number of digits d is considered a constant.    Correct Option  Option 5 only b and d is correct because  Selection Sort has On2 as its best case time complexity. Radix Sort has On  k as its best case time complexity

Which all statements are correct about Sorting

Detailed Solution

More Basics of Computers Questions

Hey! Ask a query

Please Register/Login