Animation of Bubble Sort

Slides:

Advertisements

Similar presentations

For(int i = 1; i

Advertisements

Introduction to Computer Science Robert Sedgewick and Kevin Wayne Recursive Factorial Demo pubic class Factorial {

CS 112 Introduction to Programming

Chapter 7 Sorting Part II. 7.3 QUICK SORT Example left right pivot i j 5 > pivot and should go to the other side. 2 < pivot and should go to.

Riyadh Philanthropic Society For Science Prince Sultan College For Woman Dept. of Computer & Information Sciences CS 102 Computer Programming II (Lab:

SORTING AND ASYMPTOTIC COMPLEXITY Lecture 12 CS2110 – Spring 2014 File searchSortAlgorithms.zip on course website (lecture notes for lectures 12, 13) contains.

Branch Predictor Animations Bi-modal, Local, Global CS450/650 Andrew Morton.

11.2 Complexity Analysis. Complexity Analysis As true computer scientists, we need a way to compare the efficiency of algorithms. Should we just use a.

CS 162 Intro to Programming II Quick Sort 1. Quicksort Maybe the most commonly used algorithm Quicksort is also a divide and conquer algorithm Advantage.

Bubble Sort Notes David Beard CS181. Bubble Sort for Strings Double pass algorithm to sort a single dimensional array. Inner loop “bubbles” largest element.

Insertion Sorting Lecture 21. Insertion Sort Start from element 2 of list location 1 –In first iteration: Compare element 1 with all of its elements to.

CS 280 Data Structures Professor John Peterson. Example: log(N) This is where things get hairy! How would you compute Log 10 (N) in a very approximate.

Understanding BubbleSort CS-502 (EMC) Fall Understanding BubbleSort CS-502, Operating Systems Fall 2009 (EMC) (Slides include materials from Modern.

CS 280 Data Structures Professor John Peterson. Log Complexity int j = n; while (j > 0) { System.out.println(j); j = j / 2; /* Integer division! */ }

CS 106 Introduction to Computer Science I 03 / 03 / 2008 Instructor: Michael Eckmann.

CSSE221: Software Dev. Honors Day 22 Announcements Announcements No written part to Homework 8 No written part to Homework 8 You can focus on Simulation.

CS 106 Introduction to Computer Science I 03 / 08 / 2010 Instructor: Michael Eckmann.

CS2420: Lecture 8 Vladimir Kulyukin Computer Science Department Utah State University.

Data Structures & Algorithms Sorting. Recall Selection Sort Insertion Sort Merge Sort Now consider Bubble Sort Shell Sort Quick Sort Sorting.

Simple Sort Algorithms Selection Sort Bubble Sort Insertion Sort.

ALGORITHM ANALYSIS AND DESIGN INTRODUCTION TO ALGORITHMS CS 413 Divide and Conquer Algortihms: Binary search, merge sort.

F453 Computing Searches. Binary Trees Not this kind of tree!

CSC 172 DATA STRUCTURES. SORTING Exercise : write a method that sorts an array. void mysort(int [] a) { }

Introduction to Programming (in C++) Complexity Analysis of Algorithms

ECE 103 Engineering Programming Chapter 24 Sorting Herbert G. Mayer, PSU CS Status 6/2/2015 Initial content copied verbatim from ECE 103 material developed.

CSI1390 – Java Programming Methods II Instructor: Saeid Nourian

Chapter 5 Algorithms (2) Introduction to CS 1 st Semester, 2015 Sanghyun Park.

CS 162 Intro to Programming II Bubble Sort 1. Compare adjacent elements. If the first is greater than the second, swap them. Do this for each pair of.

21/3/00SEM107 - © Kamin & ReddyClass 14 - Sorting - 1 Class 14 - Review: Sorting & searching r What are sorting and searching? r Simple sorting algorithms.

CS 106 Introduction to Computer Science I 03 / 02 / 2007 Instructor: Michael Eckmann.

Chapter 5 Algorithms (1) Introduction to CS 1 st Semester, 2012 Sanghyun Park.

CS 162 Intro to Programming II Insertion Sort 1. Assume the initial sequence a[0] a[1] … a[k] is already sorted k = 0 when the algorithm starts Insert.

Bubble Sort Example

Print Row Function void PrintRow(float x[ ][4],int i) { int j; for(j=0;j

CS 162 Intro to Programming II Sorting Introduction & Selection Sort 1.

Int fact (int n) { If (n == 0) return 1; else return n * fact (n – 1); } 5 void main () { Int Sum; : Sum = fact (5); : } Factorial Program Using Recursion.

QUICKSORT Quicksort is a sort-in-place algorithm that uses “divide-and-conquer”. First, partition the array into two subarrays A and B such that all in.

CSC 142 Q 1 CSC 142 Sorting [Reading: chapter 11].

Array Sort. Sort Pass 1 Sort Pass 2 Sort Pass 3.

CSCE 210 Data Structures and Algorithms

COP 3503 FALL 2012 Shayan Javed Lecture 16

Chapter 9: Searching, Sorting, and Algorithm Analysis

CS150 Introduction to Computer Science 1

Alg2_1c Extra Material for Alg2_1

Priority Queues Linked-list Insert Æ Æ head head

Sorting Given a[0], a[1], ..., a[n-1] reorder entries so that

محاور المحاضرة خوارزمية الفقاعات الهوائية (Bubble Sort)

CS-401 Computer Architecture & Assembly Language Programming

slides adapted from Marty Stepp

Visit for More Learning Resources

Example. Sort {5, 1, 12, -5, 16, 2, 12, 14} using selection sort. Complexity analysis.

Template Functions Lecture 9 Fri, Feb 9, 2007.

CS150 Introduction to Computer Science 1

CS148 Introduction to Programming II

CH Gowri Kumar Insertion Sort CH Gowri Kumar

slides adapted from Marty Stepp

Running Time Exercises

Introduction to Sorting Algorithms

Insertion Sort and Shell Sort

CSE 373 Sorting 2: Selection, Insertion, Shell Sort

Կարգավորում Insertion Sort, Merge Sort

BETONLINEBETONLINE A·+A·+

CS 165: Project in Algorithms and Data Structures Michael T. Goodrich

CS148 Introduction to Programming II

Stacks, Queues, ListNodes

Visit for more Learning Resources

Presentation transcript:

Animation of Bubble Sort Steven Strecker CS510 Computer Algorithms Kalamazoo College

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

A N E X A M P L E void bubbles(itemtype a[], int n) bubbles(a[], 9) { int i, j; for (i = n; i >= 1; i--) for ( i = 9; i >= 1; i--) for (j = 2; j <= i; j++) for (j = 2; j <= 9; j++) if ((a[j-1] > a[j]) if (a[2-1] > a[2] no swap(a, j-1, j); }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

THE END