bubble sort pseudocode code example

Example 1: interchange sort in system programming

#include<stdio.h>
void BubbleSort(int arr[],int len){
    for(int j = 0 ; j < len-1 ; j ++){
        for(int i = 0; i < len-1 ; i++){
            if(arr[i] > arr[i+1]){
                int temp = arr[i+1];
                arr[i+1] = arr[i];
                arr[i] = temp;
            }
        }
    
    }
    printf("\nBubble Sorted Array : ");
    for(int i = 0; i < len ; i++){
           printf(" %d",arr[i]); 
        }
}
int main(){ 
    printf("Please Enter Size of Array you want to Sort \n > ");
    int len; 
    scanf("%d",&len);
    int arr[len] ;
    for(int i = 0 ; i < len ; i++){
        printf("\n Please Enter %d number of Element of Array \n",i);
        scanf("%d",&arr[i]);
    }
    BubbleSort(arr,len);
    return 0;
}

Example 2: Psedocode bubble sort

procedure bubbleSort( list : array of items )

   loop = list.count;
   
   for i = 0 to loop-1 do:
      swapped = false
		
      for j = 0 to loop-1 do:
      
         /* compare the adjacent elements */   
         if list[j] > list[j+1] then
            /* swap them */
            swap( list[j], list[j+1] )		 
            swapped = true
         end if
         
      end for
      
      /*if no number was swapped that means 
      array is sorted now, break the loop.*/
      
      if(not swapped) then
         break
      end if
      
   end for
   
end procedure return list

Example 3: bubble sort integers

for (int i = 0; i < n-1; i++) 
            for (int j = 0; j < n-i-1; j++) 
                if (arr[j] > arr[j+1]) 
                { 
                    // swap arr[j+1] and arr[i] 
                    int temp = arr[j]; 
                    arr[j] = arr[j+1]; 
                    arr[j+1] = temp; 
                }