Answer Posted / Ratan Singh
The answer to this question can vary based on the specific use case and size of data. However, in general, quicksort and mergesort are often considered faster than bubble sort for larger datasets due to their average and best-case time complexities (O(n log n)). While the worst-case complexity of quicksort is also O(n^2), it's less common compared to bubble sort, which has a worst-case complexity of O(n^2).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
Write a program for Sorting an Array. Which sorting will you prefer?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
