Answer Posted / Bipin Kumar Shukla
Reduction to sorting (Rts) is a problem-solving technique where a given problem is transformed into a sorting problem. This technique can be applied when the original problem has an algorithmic solution that involves sorting. The sorted output of the reduced problem helps solve the original problem.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Can you declare an array without assigning the size of an array?
“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?
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?
