Download ppt - Animation of Bubble Sort

Transcript
Page 1: Animation of Bubble Sort

Animation of Bubble Sort

Steven StreckerSteven Strecker

CS510 Computer AlgorithmsCS510 Computer Algorithms

Kalamazoo College

Page 2: Animation of Bubble Sort

Introduction

void bubble(itemType a[], int N)void bubble(itemType a[], int N){{ int i, j;int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j);swap(a, j-1, j);}}

Page 3: Animation of Bubble Sort

A N E X A M P L E

void bubbles(itemtype a[], int n) bubbles(a[], 9)void bubbles(itemtype a[], int n) bubbles(a[], 9){{ int i, j;int i, j; for (i = n; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = n; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2] if ((a[j-1] > a[j]) if (a[2-1] > a[2]

nono swap(a, j-1, j);swap(a, j-1, j);}}

Page 4: Animation of Bubble Sort

A N E X A M P L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[2]>a[3]) YESif ((a[j-1] > a[j]) if (a[2]>a[3]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 5: Animation of Bubble Sort

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[2]>a[3]) YESif ((a[j-1] > a[j]) if (a[2]>a[3]) YES swap(a, j-1, j); swap(a, 2, 3)swap(a, j-1, j); swap(a, 2, 3)}}

A E N X A M P L E

Page 6: Animation of Bubble Sort

A E N X A M P L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[3]>a[4]) NOif ((a[j-1] > a[j]) if (a[3]>a[4]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 7: Animation of Bubble Sort

A E N X A M P L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[4]>a[5]) YESif ((a[j-1] > a[j]) if (a[4]>a[5]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 8: Animation of Bubble Sort

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[4]>a[5]) YESif ((a[j-1] > a[j]) if (a[4]>a[5]) YES swap(a, j-1, j); swap(a, 4, 5); swap(a, j-1, j); swap(a, 4, 5);

}}

A E N A X M P L E

Page 9: Animation of Bubble Sort

A E N A X M P L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[5]>a[6]) YESif ((a[j-1] > a[j]) if (a[5]>a[6]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 10: Animation of Bubble Sort

A E N A M X P L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[5]>a[6]) YESif ((a[j-1] > a[j]) if (a[5]>a[6]) YES swap(a, j-1, j); swap(a, 5, 6); swap(a, j-1, j); swap(a, 5, 6);

}}

Page 11: Animation of Bubble Sort

A E N A M X P L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[6]>a[7]) YESif ((a[j-1] > a[j]) if (a[6]>a[7]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 12: Animation of Bubble Sort

A E N A M P X L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[6]>a[7]) YESif ((a[j-1] > a[j]) if (a[6]>a[7]) YES swap(a, j-1, j); swap(a, 6, 7); swap(a, j-1, j); swap(a, 6, 7);

}}

Page 13: Animation of Bubble Sort

A E N A M P X L E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[7]>a[8]) YESif ((a[j-1] > a[j]) if (a[7]>a[8]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 14: Animation of Bubble Sort

A E N A M P L X E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[7]>a[8]) YESif ((a[j-1] > a[j]) if (a[7]>a[8]) YES swap(a, j-1, j); swap(a, 7, 8); swap(a, j-1, j); swap(a, 7, 8);

}}

Page 15: Animation of Bubble Sort

A E N A M P L X E

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[8]>a[9]) YESif ((a[j-1] > a[j]) if (a[8]>a[9]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 16: Animation of Bubble Sort

A E N A M P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j;int i, j; for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--)for (i = N; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++)for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[8]>a[9]) YESif ((a[j-1] > a[j]) if (a[8]>a[9]) YES swap(a, j-1, j); swap(a, 8, 9); swap(a, j-1, j); swap(a, 8, 9);

}}

Page 17: Animation of Bubble Sort

A E N A M P L E X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j);swap(a, j-1, j);}}

Page 18: Animation of Bubble Sort

A E N A M P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 19: Animation of Bubble Sort

A E N A M P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) NOif ((a[j-1] > a[j]) if (a[3-1] > a[3]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 20: Animation of Bubble Sort

A E N A M P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[4-1] > a[4]) YESif ((a[j-1] > a[j]) if (a[4-1] > a[4]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 21: Animation of Bubble Sort

A E A N M P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[4-1] > a[4]) YESif ((a[j-1] > a[j]) if (a[4-1] > a[4]) YES swap(a, j-1, j); swap(a, 3, 4) swap(a, j-1, j); swap(a, 3, 4) }}

Page 22: Animation of Bubble Sort

A E A N M P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) YESif ((a[j-1] > a[j]) if (a[5-1] > a[5]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 23: Animation of Bubble Sort

A E A M N P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) YESif ((a[j-1] > a[j]) if (a[5-1] > a[5]) YES swap(a, j-1, j); swap(a, 4, 5) swap(a, j-1, j); swap(a, 4, 5) }}

Page 24: Animation of Bubble Sort

A E A M N P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[6-1] > a[6]) NOif ((a[j-1] > a[j]) if (a[6-1] > a[6]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 25: Animation of Bubble Sort

A E A M N P L E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[7-1] > a[7]) YESif ((a[j-1] > a[j]) if (a[7-1] > a[7]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 26: Animation of Bubble Sort

A E A M N L P E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[7-1] > a[7]) YESif ((a[j-1] > a[j]) if (a[7-1] > a[7]) YES swap(a, j-1, j); swap(a, 6, 7)swap(a, j-1, j); swap(a, 6, 7)}}

Page 27: Animation of Bubble Sort

A E A M N L P E X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[8-1] > a[8]) YESif ((a[j-1] > a[j]) if (a[8-1] > a[8]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 28: Animation of Bubble Sort

A E A M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=8; j++)for (j = 2; j <= i; j++) for (j = 2; j<=8; j++) if ((a[j-1] > a[j]) if (a[8-1] > a[8]) YESif ((a[j-1] > a[j]) if (a[8-1] > a[8]) YES swap(a, j-1, j); swap(a, 7, 8)swap(a, j-1, j); swap(a, 7, 8)}}

Page 29: Animation of Bubble Sort

A E A M N L E P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 30: Animation of Bubble Sort

A E A M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 31: Animation of Bubble Sort

A E A M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) YESif ((a[j-1] > a[j]) if (a[3-1] > a[3]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 32: Animation of Bubble Sort

A A E M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) YESif ((a[j-1] > a[j]) if (a[3-1] > a[3]) YES swap(a, j-1, j); swap(a, 2, 3) swap(a, j-1, j); swap(a, 2, 3) }}

Page 33: Animation of Bubble Sort

A A E M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[4-1] > a[4]) NOif ((a[j-1] > a[j]) if (a[4-1] > a[4]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 34: Animation of Bubble Sort

A A E M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) NOif ((a[j-1] > a[j]) if (a[5-1] > a[5]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 35: Animation of Bubble Sort

A A E M N L E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[6-1] > a[6]) YESif ((a[j-1] > a[j]) if (a[6-1] > a[6]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 36: Animation of Bubble Sort

A A E M L N E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[6-1] > a[6]) YESif ((a[j-1] > a[j]) if (a[6-1] > a[6]) YES swap(a, j-1, j); swap(a, 5, 6);swap(a, j-1, j); swap(a, 5, 6);}}

Page 37: Animation of Bubble Sort

A A E M L N E P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[7-1] > a[7]) YESif ((a[j-1] > a[j]) if (a[7-1] > a[7]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 38: Animation of Bubble Sort

A A E M L E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=7; j++)for (j = 2; j <= i; j++) for (j = 2; j<=7; j++) if ((a[j-1] > a[j]) if (a[7-1] > a[7]) YESif ((a[j-1] > a[j]) if (a[7-1] > a[7]) YES swap(a, j-1, j); swap(a, 6, 7);swap(a, j-1, j); swap(a, 6, 7);}}

Page 39: Animation of Bubble Sort

A A E M L E N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 40: Animation of Bubble Sort

A A E M L E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 41: Animation of Bubble Sort

A A E M L E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) NOif ((a[j-1] > a[j]) if (a[3-1] > a[3]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 42: Animation of Bubble Sort

A A E M L E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[4-1] > a[4]) NOif ((a[j-1] > a[j]) if (a[4-1] > a[4]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 43: Animation of Bubble Sort

A A E M L E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) YESif ((a[j-1] > a[j]) if (a[5-1] > a[5]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 44: Animation of Bubble Sort

A A E L M E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) YESif ((a[j-1] > a[j]) if (a[5-1] > a[5]) YES swap(a, j-1, j); swap(a, 4, 5)swap(a, j-1, j); swap(a, 4, 5)}}

Page 45: Animation of Bubble Sort

A A E L M E N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[6-1] > a[6]) YESif ((a[j-1] > a[j]) if (a[6-1] > a[6]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 46: Animation of Bubble Sort

A A E L E M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=6; j++)for (j = 2; j <= i; j++) for (j = 2; j<=6; j++) if ((a[j-1] > a[j]) if (a[6-1] > a[6]) YESif ((a[j-1] > a[j]) if (a[6-1] > a[6]) YES swap(a, j-1, j); swap(a, 5, 6)swap(a, j-1, j); swap(a, 5, 6)}}

Page 47: Animation of Bubble Sort

A A E L E M N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 48: Animation of Bubble Sort

A A E L E M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=5; j++)for (j = 2; j <= i; j++) for (j = 2; j<=5; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 49: Animation of Bubble Sort

A A E L E M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=5; j++)for (j = 2; j <= i; j++) for (j = 2; j<=5; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) NOif ((a[j-1] > a[j]) if (a[3-1] > a[3]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 50: Animation of Bubble Sort

A A E L E M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=5; j++)for (j = 2; j <= i; j++) for (j = 2; j<=5; j++) if ((a[j-1] > a[j]) if (a[4-1] > a[4]) NOif ((a[j-1] > a[j]) if (a[4-1] > a[4]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 51: Animation of Bubble Sort

A A E L E M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=5; j++)for (j = 2; j <= i; j++) for (j = 2; j<=5; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) YESif ((a[j-1] > a[j]) if (a[5-1] > a[5]) YES swap(a, j-1, j);swap(a, j-1, j);}}

Page 52: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=5; j++)for (j = 2; j <= i; j++) for (j = 2; j<=5; j++) if ((a[j-1] > a[j]) if (a[5-1] > a[5]) YESif ((a[j-1] > a[j]) if (a[5-1] > a[5]) YES swap(a, j-1, j); swap(a, 4, 5)swap(a, j-1, j); swap(a, 4, 5)}}

Page 53: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 54: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=4; j++)for (j = 2; j <= i; j++) for (j = 2; j<=4; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 55: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=4; j++)for (j = 2; j <= i; j++) for (j = 2; j<=4; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) NOif ((a[j-1] > a[j]) if (a[3-1] > a[3]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 56: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=4; j++)for (j = 2; j <= i; j++) for (j = 2; j<=4; j++) if ((a[j-1] > a[j]) if (a[4-1] > a[4]) NOif ((a[j-1] > a[j]) if (a[4-1] > a[4]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 57: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 58: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=3; j++)for (j = 2; j <= i; j++) for (j = 2; j<=3; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 59: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=3; j++)for (j = 2; j <= i; j++) for (j = 2; j<=3; j++) if ((a[j-1] > a[j]) if (a[3-1] > a[3]) NOif ((a[j-1] > a[j]) if (a[3-1] > a[3]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 60: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 61: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N) bubbles(a[], 9)void bubbles(itemType a[], int N) bubbles(a[], 9){{ int i, j; int i, j; for (i = N; i >= 1; i--) for (i = 9; i>=1; i--)for (i = N; i >= 1; i--) for (i = 9; i>=1; i--) for (j = 2; j <= i; j++) for (j = 2; j<=2; j++)for (j = 2; j <= i; j++) for (j = 2; j<=2; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2]) NOif ((a[j-1] > a[j]) if (a[2-1] > a[2]) NO swap(a, j-1, j); swap(a, j-1, j); }}

Page 62: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 63: Animation of Bubble Sort

A A E E L M N P X

void bubbles(itemType a[], int N)void bubbles(itemType a[], int N){{ int i, j; int i, j; for (i = N; i >= 1; i--)for (i = N; i >= 1; i--) for (j = 2; j <= i; j++)for (j = 2; j <= i; j++) if ((a[j-1] > a[j])if ((a[j-1] > a[j]) swap(a, j-1, j); swap(a, j-1, j); }}

Page 64: Animation of Bubble Sort

THE END


Recommended

Q.1 Explain Bubble sort and its algorithm.SUB: DS Unit: 2 Q.1 Explain Bubble sort and its algorithm.Ans. Bubble sort: Bubble Sort is an algorithm which is used to sort N elements that
Q.1 Explain Bubble sort and its algorithm.SUB: DS Unit: 2 Q.1 Explain Bubble sort and its algorithm.Ans. Bubble sort: Bubble Sort is an algorithm which is used to sort N elements that Documents
Sorting bubble-sort anim
Sorting bubble-sort anim Education
Sorting bubble-sort
Sorting bubble-sort Education
In this chapter we shall discuss two sorting techniques: 1. Bubble Sort … · 2020. 1. 10. · 1. Bubble Sort 2. Insertion Sort 1. BUBBLE SORT: Bubble sort is a simple sorting algorithm
In this chapter we shall discuss two sorting techniques: 1. Bubble Sort … · 2020. 1. 10. · 1. Bubble Sort 2. Insertion Sort 1. BUBBLE SORT: Bubble sort is a simple sorting algorithm Documents
Laporan Praktikum Bubble Sort
Laporan Praktikum Bubble Sort Documents
Sorting Algorithms Bubble Sort Merge Sort Quick Sort Randomized Quick Sort
Sorting Algorithms Bubble Sort Merge Sort Quick Sort Randomized Quick Sort Documents
Bubble and-merge-sort
Bubble and-merge-sort Education
Bubble,insertion,selection sort
Bubble,insertion,selection sort Education
Sorting (Bubble,Merge,Selection sort)
Sorting (Bubble,Merge,Selection sort) Data & Analytics
Sorting: Bubble Sort - venus.cs.qc.cuny.eduvenus.cs.qc.cuny.edu/~kchin/past/spring2015/cs90/slides/Bubble Sort... · Bubble Sort Idea 1) Start looking at the first pair of numbers
Sorting: Bubble Sort - venus.cs.qc.cuny.eduvenus.cs.qc.cuny.edu/~kchin/past/spring2015/cs90/slides/Bubble Sort... · Bubble Sort Idea 1) Start looking at the first pair of numbers Documents
UNIT- V: Sorting: Bubble sort, Merge sort, Insertion Sort, Selection ... · PDF fileUNIT- V: Sorting: Bubble sort, Merge sort, Insertion Sort, Selection Sort, Quick Sort. Searching:
UNIT- V: Sorting: Bubble sort, Merge sort, Insertion Sort, Selection ... · PDF fileUNIT- V: Sorting: Bubble sort, Merge sort, Insertion Sort, Selection Sort, Quick Sort. Searching: Documents
Selection Sort, Insertion Sort, Bubble, & Shellsort CPS212, Gordon College
Selection Sort, Insertion Sort, Bubble, & Shellsort CPS212, Gordon College Documents
BUBBLE SORT BUBBLE SORT INSERTION SORT INSERTION SORT SELECTION SORT SELECTION SORT RADIX SORT RADIX SORT
BUBBLE SORT BUBBLE SORT INSERTION SORT INSERTION SORT SELECTION SORT SELECTION SORT RADIX SORT RADIX SORT Documents
Bubble Sort! content/uploads/2010/05/sort - cs.ucsb.edubboe/cs32_m12/slides/sort/bubble_01.pdf · How does a bubble sort algorithm work? Bubble sort algorithms cycle through a list,
Bubble Sort! content/uploads/2010/05/sort - cs.ucsb.edubboe/cs32_m12/slides/sort/bubble_01.pdf · How does a bubble sort algorithm work? Bubble sort algorithms cycle through a list, Documents
Bubble Sort! content/uploads/2010/05/sort - sites.cs.ucsb.edubboe/cs32_m12/slides/sort/bubble_01.pdf · In a bubble sorting algorithm, the elements of the list "gradually 'bubble
Bubble Sort! content/uploads/2010/05/sort - sites.cs.ucsb.edubboe/cs32_m12/slides/sort/bubble_01.pdf · In a bubble sorting algorithm, the elements of the list "gradually 'bubble Documents
Bubble Sort An Archaelogical Algorithmic Analysisola/bubble/bubble-pres.pdf · Bubblesort 2 Bubble sort: what can we study? What is bubble sort and what are its origins? When did
Bubble Sort An Archaelogical Algorithmic Analysisola/bubble/bubble-pres.pdf · Bubblesort 2 Bubble sort: what can we study? What is bubble sort and what are its origins? When did Documents
SORTING ROUTINES. OBJECTIVES INTRODUCTION BUBBLE SORT SELECTION SORT INSERTION SORT QUICK SORT MERGE SORT
SORTING ROUTINES. OBJECTIVES INTRODUCTION BUBBLE SORT SELECTION SORT INSERTION SORT QUICK SORT MERGE SORT Documents
Bubble Sort - Emory University · Sorting • Lots of algorithms for sorting – Selection sort (video lecture and textbook) – Insertion sort (textbook) – Bubble sort – Merge
Bubble Sort - Emory University · Sorting • Lots of algorithms for sorting – Selection sort (video lecture and textbook) – Insertion sort (textbook) – Bubble sort – Merge Documents