Answer Posted / Sachin Kumar Mourya
Quick Sort is a divide-and-conquer algorithm used for sorting. It works by selecting a pivot element and partitioning the remaining elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
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?
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.
Write a program for Sorting an Array. Which sorting will you prefer?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
