interchange sort in system programming code example
Example 1: bubble sort c
#include <bits/stdc++.h>
using namespace std;
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
void bubbleSort(int arr[], int n)
{
int i, j;
for (i = 0; i < n-1; i++)
for (j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
swap(&arr[j], &arr[j+1]);
}
void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
cout<<"Sorted array: \n";
printArray(arr, n);
return 0;
}
Example 2: 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;
}