Answer Posted / Ritesh Kumar Jaiswal
You can perform any sorting algorithm and modify it slightly to sort an array in decreasing order. For example, for bubble sort:
1. Initialize the array as unsorted.
2. For each step i from 0 to len(array)-1:
a. For j from 0 to len(array)-i-1:
i) If array[j] > array[j+1]: swap array[j] and array[j+1].
The above pseudocode is similar to bubble sort, but it compares the larger value first before swapping. This ensures that the sorted array will be in decreasing order.
| 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?
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.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
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)
