Answer Posted / Barun Pratap Singh
Insertion sort is often employed when the input list is nearly sorted or small in size. It's useful for sorting data that has a few out-of-place elements, as it maintains the order of the first part of the array while inserting each subsequent element in its correct position.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
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?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Can you declare an array without assigning the size of an array?
What sort of serious problems have you experienced, and how have you handled them?
