Answer Posted / Trapti Gupta
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. Here's some pseudocode:
1. Start from the first element of the list (except for the last one)
2. Compare the current element with the next one. If it is greater, swap them.
3. Move to the next pair of elements and repeat the process until you reach the end of the list.
4. Repeat the entire process from step 1, but now if there are no more swaps in a pass, the list is sorted.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
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.
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
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?
