Bubble Sort

Download Bubble_Sort

Last login: Sun Dec 23 13:26:10 on ttys000
Zhenlins-MacBook-Pro:~ pei$ cd CPP/Sorting/
Zhenlins-MacBook-Pro:Sorting pei$ ls
Bubble_Sort
Zhenlins-MacBook-Pro:Sorting pei$ cd Bubble_Sort/
Zhenlins-MacBook-Pro:Bubble_Sort pei$ vim Bubble_Sort.cpp

// Optimized implementation of Bubble sort 

#include <stdio.h> 

void swap(int *xp, int *yp) 

{ 

int temp = *xp; 

*xp = *yp; 

*yp = temp; 

} 

// An optimized version of Bubble Sort 

void bubbleSort(int arr[], int n) 

{ 

int i, j; 

bool swapped; 

for (i = 0; i < n-1; i++) 

{ 

swapped = false; 

for (j = 0; j < n-i-1; j++) 

{ 

if (arr[j] > arr[j+1]) 

{ 

swap(&arr[j], &arr[j+1]); 

swapped = true; 

} 

} 

// IF no two elements were swapped by inner loop, then break 

if (swapped == false) 

break; 

} 

} 

/* Function to print an array */

void printArray(int arr[], int size) 

{ 

int i; 

for (i=0; i < size; i++) 

printf(“%d “, arr[i]); 

printf(“\n”); 

} 

// Driver program to test above functions 

int main() 

{ 

int arr[] = {64, 34, 25, 12, 22, 11, 90}; 

int n = sizeof(arr)/sizeof(arr[0]); 

bubbleSort(arr, n); 

printf(“Sorted array: \n”); 

printArray(arr, n); 

return 0; 

} 

---

Zhenlins-MacBook-Pro:Bubble_Sort pei$ g++ Bubble_Sort.cpp
Zhenlins-MacBook-Pro:Bubble_Sort pei$ ls -rtl
total 32
-rw-r–r– 1 pei staff 913 Dec 23 14:56 Bubble_Sort.cpp
-rwxr-xr-x 1 pei staff 8740 Dec 23 15:12 a.out
Zhenlins-MacBook-Pro:Bubble_Sort pei$ ./a.out
Sorted array:
11 12 22 25 34 64 90
Zhenlins-MacBook-Pro:Bubble_Sort pei$

---