Answers for "Algorithm of bubble sort"

0

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;
}
Posted by: Guest on December-19-2020
1

Bubble Sort

#Bubble Sort
nums = [9, 4, 5, 1, 3, 7, 6]
for i in range(len(nums)):
    for j in range(1, len(nums)):
        if nums[j] < nums[j - 1]:
            nums[j], nums[j - 1] = nums[j - 1], nums[j]
Posted by: Guest on August-15-2021
3

bubble sort code

func Sort(arr []int) []int {
	for i := 0; i < len(arr)-1; i++ {
		for j := 0; j < len(arr)-i-1; j++ {
			if arr[j] > arr[j+1] {
				temp := arr[j]
				arr[j] = arr[j+1]
				arr[j+1] = temp
			}
		}
	}
	return arr
}
Posted by: Guest on August-16-2020
0

Algorithm of bubble sort

begin BubbleSort(list)

   for all elements of list
      if list[i] > list[i+1]
         swap(list[i], list[i+1])
      end if
   end for
   
   return list
   
end BubbleSort
Posted by: Guest on May-27-2021

Code answers related to "Algorithm of bubble sort"

Browse Popular Code Answers by Language