Solved

Bubble Sort needs a modification

Posted on 2008-10-30
4
632 Views
Last Modified: 2008-10-30
I have a bubble sort script. It compares values after the first pass, the largest number is guaranteed to be in the highest -numbered element of the array; after the second pass, the two highest numbers are "in place", and so on. Instead of making nine comparisons on every pass, I need to modify the bubble sort to make eight comparisons on the second pass, seven on the third pass, and so on.

The code is attached, thank you.
#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 };
	int pass; /* passes counter */
	int i; /* comparison counter */
	int hold; /* temporary location used to swap array elements */
 
	printf( "Data items in original order\n" );
 
	/* output original array */
	for ( i = 0; i < SIZE; i++ ) {
		printf( "%4d", a[ i ] );
	} /* end for */
 
	/* bubble sort */
	/* loop to control number of passes */
	for ( pass = 1; pass < SIZE; pass++ ) {
 
		/* loop to control number of comparisons per pass */
		for ( i = 0; i < SIZE - 1; i++ ) {
 
			/* compare adjacent elements and swap them if first element is greater than second element */
			if ( a[ i ] > a[ i + 1 ] ) {
				hold = a[ i ];
				a[ i ] = a[ i + 1 ];
				a[ i + 1 ] = hold;
			} /* end if */
 
		} /* end inner for */
 
	} /* end outer for */
 
	printf( "\nData items in ascending order\n" );
 
	/* output sorted array */
	for ( i = 0; i < SIZE; i++ ) {
		printf( "%4d", a[ i ] );
	} /* end for */
 
	printf( "\n" );
 
	return 0; /* indicates successful termination */
}

Open in new window

0
Comment
Question by:Doomtomb
  • 2
  • 2
4 Comments
 
LVL 53

Accepted Solution

by:
Infinity08 earned 500 total points
ID: 22845317
You only have to change the upper limit of the inner loop. Use the current value of 'pass' for that ...
0
 

Author Comment

by:Doomtomb
ID: 22845396
Ok, I think I got it, now I have one last modification I have to make:

The data in the array may already be in the proper order or near-proper order, so why make nine passes if fewer will suffice? Modify the sort to check at the end of each pass whether any swaps have been made. If none are made, then the data must already be in the proper order, so the program should end. If swaps have been made, then at least one more pass is needed.

(yes this is for a class)

I have attached the new script, all that's changed from the original is on the inner loop "i = 0" to "i = pass - 1"
/* Program 8: Due 10/31/08 
Description: Bubble Sort
for Sandra Jeffers
Engineering Programming EG1304
10:20am Mon-Wed-Fri */
#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 };
	int pass; /* passes counter */
	int i; /* comparison counter */
	int hold; /* temporary location used to swap array elements */
	int swap;
 
	printf( "Data items in original order\n" );
 
	/* output original array */
	for ( i = 0; i < SIZE; i++ ) {
		printf( "%4d", a[ i ] );
	} /* end for */
 
	/* bubble sort */
	/* loop to control number of passes */
	for ( pass = 1; pass < SIZE; pass++ ) {
 
		/* loop to control number of comparisons per pass */
		for ( i = pass - 1; i < SIZE - 1; i++ ) {
 
			/* compare adjacent elements and swap them if first element is greater than second element */
			if ( a[ i ] > a[ i + 1 ] ) {
				hold = a[ i ];
				a[ i ] = a[ i + 1 ];
				a[ i + 1 ] = hold;
				swap++;
			} /* end if */
 
		} /* end inner for */
 
		if ( swap == 0 )
			break;
 
	} /* end outer for */
 
	printf( "\nData items in ascending order\n" );
 
	/* output sorted array */
	for ( i = 0; i < SIZE; i++ ) {
		printf( "%4d", a[ i ] );
	} /* end for */
 
	printf( "\n" );
 
	return 0; /* indicates successful termination */
}

Open in new window

0
 

Author Comment

by:Doomtomb
ID: 22845417
NVMD I GOT this working, sorry, I stared at this for like 30 mins and had no clue and then in like 5 mins i tried just a couple things and it worked, sorry for wasting your time, ill award points.
0
 
LVL 53

Expert Comment

by:Infinity08
ID: 22845436
>> all that's changed from the original is on the inner loop "i = 0" to "i = pass - 1"

Since you do your bubble sort starting from the back (ie. the last value is put in place first), it's better to change the upper limit, rather than the lower limit like you did ;)
0

Featured Post

Does Powershell have you tied up in knots?

Managing Active Directory does not always have to be complicated.  If you are spending more time trying instead of doing, then it's time to look at something else. For nearly 20 years, AD admins around the world have used one tool for day-to-day AD management: Hyena. Discover why

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

This tutorial is posted by Aaron Wojnowski, administrator at SDKExpert.net.  To view more iPhone tutorials, visit www.sdkexpert.net. This is a very simple tutorial on finding the user's current location easily. In this tutorial, you will learn ho…
Summary: This tutorial covers some basics of pointer, pointer arithmetic and function pointer. What is a pointer: A pointer is a variable which holds an address. This address might be address of another variable/address of devices/address of fu…
The viewer will learn additional member functions of the vector class. Specifically, the capacity and swap member functions will be introduced.
The viewer will learn how to clear a vector as well as how to detect empty vectors in C++.

770 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question