Bubble Sort

Introduction Generations of Computers Classification of Computers Basic Anatomy of a Computer System Memory Management Computer Software Operating System

Algorithm Flowcharts

Programming Language Generations of Programming Languages Introduction to C Structure of C Programming Language Integrated Development Environment First C program, Hello World Executing a C Program Constants in C Variables in C C Storage Classes and Storage Class Specifiers

Introduction Arithmetic operators Relational Operators Logical Operators Assignment Operator Increment and Decrement Operators Conditional Operators Bitwise Operators Precedence and Associativity

Control Instructions in C if Statement in C if-else Statement Nested if-else statement else if ladder Switch Statements in C

Loops Introduction for Loop while loop in C do-while Loop break and continue statements

Array in C One Dimensional array Two Dimensional Array Multidimensional Arrays

Modular Programming Functions

Searching Techniques Linear Search Algorithm Binary-Search-Algorithm

Sorting Introduction Bubble Sort

What is Strings Standard Library String Functions

Structure Introduction Defining a Structure Declaration of Structure Example of Structure Union Introduction Defining a Union Accessing Union Members

Pointers in C Accessing the Address of a variable Pointer Operations

Dynamic Memory Allocation

Bubble sort is a simple sorting method. This sorting method is a comparison-based algorithm in which each pair of adjacent elements is compared, and if they are not in order, the elements are swapped.

As items are sorted in the bubble sort, they "bubble" (or rise) to their proper position in the array, similar to bubbles rising in a glass of soda. The bubble sort compares nearby array elements repeatedly. If the first and second items are out of order, they are compared and switched. The second and third items are then compared and, if out of order, swapped. This sorting procedure continues until the array's last two members are compared and, if out of order, then switched.

When the first pass over the array is finished, the bubble sort goes back to elements one and two and repeats the procedure. So, when does it come to a halt? When the bubble sort has examined the entire array and no "swaps" are required, it knows it is finished (thus the list is in proper order).

Before, during, and after a bubble sort for decreasing order, the table below shows an array of numbers. A "pass" is described as a complete loop across the array, comparing and swapping neighbouring elements as needed. Before the array can be sorted, it must be passed through several times.

Although the bubble sort is a simple method to code, it is slower than many other sorts. With a bubble sort, one final "pass" through the array is always required to confirm that no swaps are done and that the operation is complete. In reality, the procedure is complete before this final pass is performed.

Fundamentals of the Computer System

Introduction to Algorithm

Programming Basics

Operators in C

Conditional Branching

Iteration and Loops

Array in C

Functions in C

Searching Algorithms

Sorting Algorithms

Strings

Structures and Union

Pointers in C

File Handling in C

Advanced

Bubble Sort