Consider the Bubble Sort algorithm we developed in class. It works, but it may waste some activity. Starting with the code from class, make the following modifications, to make Bubble Sort more efficient. 1. After the first pass, the largest number is guaranteed to be in the highest numbered array index; after the second pass, the two highest numbers are in place; and so on. Modify the code so the sorting algorithm doesn't bother to make comparisons with these already-in- place elements. For an array of size n, in the first pass n-1 comparisons are required; on the second pass n-2 comparisons are required, etc. 2. What if the array is already sorted? We may be doing all these comparisons, and never changing anything in the array. Modify the sorting algorithm to check at the end of each pass whether any swaps have been made. If no swaps have been made, the array must already be sorted, so you should end the sort. If at least one swap has been made, then at least one more pass through the array is required.
Consider the Bubble Sort algorithm we developed in class. It works, but it may waste some activity. Starting with the code from class, make the following modifications, to make Bubble Sort more efficient. 1. After the first pass, the largest number is guaranteed to be in the highest numbered array index; after the second pass, the two highest numbers are in place; and so on. Modify the code so the sorting algorithm doesn't bother to make comparisons with these already-in- place elements. For an array of size n, in the first pass n-1 comparisons are required; on the second pass n-2 comparisons are required, etc. 2. What if the array is already sorted? We may be doing all these comparisons, and never changing anything in the array. Modify the sorting algorithm to check at the end of each pass whether any swaps have been made. If no swaps have been made, the array must already be sorted, so you should end the sort. If at least one swap has been made, then at least one more pass through the array is required.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
Modify the below code according to what it’s asking you.
Please show the final code in a picture.
Transcribed Image Text:Consider the Bubble Sort algorithm we developed in class. It works, but it may waste some
activity. Starting with the code from class, make the following modifications, to make Bubble
Sort more efficient.
1. After the first pass, the largest number is guaranteed to be in the highest numbered array
index; after the second pass, the two highest numbers are in place; and so on. Modify the
code so the sorting algorithm doesn't bother to make comparisons with these already-in-
place elements. For an array of size n, in the first pass n-1 comparisons are required; on
the second pass n-2 comparisons are required, etc.
2. What if the array is already sorted? We may be doing all these comparisons, and never
changing anything in the array. Modify the sorting algorithm to check at the end of each
pass whether any swaps have been made. If no swaps have been made, the array must
already be sorted, so you should end the sort. If at least one swap has been made, then at
least one more pass through the array is required.
![#include <stdio.h>
#define SIZE 10
// function main begins program execution
int main(void){
// initialize a
int a[sIzE]
{2, 6, 4, 8, 10, 12, 89, 68, 45, 37};
puts ("Data items in original order");
// output original array
for (size_t i = 0; i < SIZE; ++i) {
printf( "%4d", a[i]);
}
/ bubble sort
/ loop to control number of passes
for (unsigned int pass = 1; pass < SIZE; ++pass) {
/ loop to control number of comparisons per pass
for (size_t i = 0; i < SIZE
1; ++i) {
-
/ compare adjacent elements and swap them if first
/ element is greater than second element
if (ali] > a[i + 1]) {
int hold = a[i];
ali + 1];
ali+ 1] = hold;
a[i] =
}
}
puts ("\nData items in ascending order");
// output sorted array
for (size_t i = ®; i < SIZE; ++i) {
printf( "%4d", a[i]);
puts ("");
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F96ba71a6-eaa0-4a87-97e1-d4ab387cb8de%2F2ee3003b-86bd-4469-bebf-987d33c4b144%2F0z5gqmf_processed.jpeg&w=3840&q=75)
Transcribed Image Text:#include <stdio.h>
#define SIZE 10
// function main begins program execution
int main(void){
// initialize a
int a[sIzE]
{2, 6, 4, 8, 10, 12, 89, 68, 45, 37};
puts ("Data items in original order");
// output original array
for (size_t i = 0; i < SIZE; ++i) {
printf( "%4d", a[i]);
}
/ bubble sort
/ loop to control number of passes
for (unsigned int pass = 1; pass < SIZE; ++pass) {
/ loop to control number of comparisons per pass
for (size_t i = 0; i < SIZE
1; ++i) {
-
/ compare adjacent elements and swap them if first
/ element is greater than second element
if (ali] > a[i + 1]) {
int hold = a[i];
ali + 1];
ali+ 1] = hold;
a[i] =
}
}
puts ("\nData items in ascending order");
// output sorted array
for (size_t i = ®; i < SIZE; ++i) {
printf( "%4d", a[i]);
puts ("");
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY