使用 C 的 DSA - 冒泡排序

概述

冒泡排序是一种简单的排序算法。此排序算法是基于比较的算法，其中比较每对相邻元素，如果元素顺序不正确，则交换元素。此算法不适用于大型数据集，因为其平均和最坏情况复杂度为 O(n²)，其中 n 为项目数。

伪代码

procedure bubbleSort( A : array of items )
   for i = 1 to length(A) - 1 inclusive do:
      swapped = false
      for j = 1 to length(A) - 1 inclusive do:
         /* compare the adjacent elements */   
         if A[i-1] > A[i] then
            /* swap them */
            swap( A[i-1], A[i] )		 
            swapped = true
         end if
      end for
      /*if no number was swapped that means 
      array is sorted now, break the loop.*/
      if(!swapped) then
         break	 
   end for
end procedure

示例

#include <stdio.h>
#include <stdbool.h>
#define MAX 7

int intArray[MAX] = {4,6,3,2,1,9,7};
void printline(int count){
   int i;
   for(i=0;i <count-1;i++){
      printf("=");
   }
   printf("=
");
}
void display(){
   int i;
   printf("[");
   // navigate through all items 
   for(i=0;i<MAX;i++){
      printf("%d ",intArray[i]);
   }
	printf("]
");
}
void bubbleSort(){
   int temp;
	int i,j;
   bool swapped = false;       
   // loop through all numbers 
   for(i=0; i < MAX-1; i++){ 
      swapped = false;
      // loop through numbers falling ahead 
      for(j=1; j < MAX-i; j++){
		   printf("Items compared: [ %d, %d ]
" ,intArray[j-1],intArray[j]);
         // check if next number is lesser than current no
         // swap the numbers. 
         // (Bubble up the highest number) 
         if(intArray[j-1] > intArray[j]){
            temp=intArray[j-1];
            intArray[j-1] = intArray[j];
            intArray[j] = temp;
            swapped = true;
         }           
      }
      // if no number was swapped that means 
      // array is sorted now, break the loop. 
      if(!swapped){
         break;
      }
      printf("Iteration %d#: ",(i+1)); 
      display();                     
   }
}
main(){
   printf("Input Array: ");
   display();
   printline(50);
   bubbleSort();
   printf("Output Array: ");
   display();
   printline(50);
}

输出

如果我们编译并运行上述程序，则会产生以下输出 −

Input Array: [4, 6, 3, 2, 1, 9, 7]
==================================================
   Items compared: [ 4, 6 ]
   Items compared: [ 6, 3 ]
   Items compared: [ 6, 2 ]
   Items compared: [ 6, 1 ]
   Items compared: [ 6, 9 ]
   Items compared: [ 9, 7 ]
Iteration 1#: [4, 3, 2, 1, 6, 7, 9]
   Items compared: [ 4, 3 ]
   Items compared: [ 4, 2 ]
   Items compared: [ 4, 1 ]
   Items compared: [ 4, 6 ]
   Items compared: [ 6, 7 ]
Iteration 2#: [3, 2, 1, 4, 6, 7, 9]
   Items compared: [ 3, 2 ]
   Items compared: [ 3, 1 ]
   Items compared: [ 3, 4 ]
   Items compared: [ 4, 6 ]
Iteration 3#: [2, 1, 3, 4, 6, 7, 9]
   Items compared: [ 2, 1 ]
   Items compared: [ 2, 3 ]
   Items compared: [ 3, 4 ]
Iteration 4#: [1, 2, 3, 4, 6, 7, 9]
   Items compared: [ 1, 2 ]
   Items compared: [ 2, 3 ]
Output Array: [1, 2, 3, 4, 6, 7, 9]
==================================================

dsa_using_c_sorting_techniques.html