Scribd
Upload
14 views3 pages

Sorting Algorithms in C++ Code

The document contains implementations of three sorting algorithms: Selection Sort, Bubble Sort, and Insertion Sort, each with a function to print the sorted array. Each sorting algorithm is demonstrated with a driver program that initializes an array, sorts it, and prints the result. The code is written in C++ and includes necessary header files and function definitions.

Uploaded by

ruchikanarwaiye91
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
14 views3 pages

Sorting Algorithms in C++ Code

The document contains implementations of three sorting algorithms: Selection Sort, Bubble Sort, and Insertion Sort, each with a function to print the sorted array. Each sorting algorithm is demonstrated with a driver program that initializes an array, sorts it, and prints the result. The code is written in C++ and includes necessary header files and function definitions.

Uploaded by

ruchikanarwaiye91
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

// selection sort

#include <bits/stdc++.h>
using namespace std;

//Swap function
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}

void selectionSort(int arr[], int n)


{
int i, j, min_idx;

// One by one move boundary of


// unsorted subarray
for (i = 0; i < n-1; i++)
{

// Find the minimum element in


// unsorted array
min_idx = i;
for (j = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;

// Swap the found minimum element


// with the first element
if(min_idx!=i)
swap(&arr[min_idx], &arr[i]);
}
}

//Function to print an array


void printArray(int arr[], int size)
{
int i;
for (i=0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}

// Driver program to test above functions


int main()
{
int arr[] = {64, 25, 12, 22, 11};
int n = sizeof(arr)/sizeof(arr[0]);
selectionSort(arr, n);
cout << "Sorted array: \n";
printArray(arr, n);
return 0;
}

//Bubble Sort
#include <bits/stdc++.h>
using namespace std;

// A function to implement bubble sort


void bubbleSort(int arr[], int n)
{
int i, j;
for (i = 0; i < n - 1; i++)

// Last i elements are already


// in place
for (j = 0; j < n - i - 1; j++)
if (arr[j] > arr[j + 1])
swap(arr[j], arr[j + 1]);
}

// Function to print an array


void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}

// Driver code
int main()
{
int arr[] = { 5, 1, 4, 2, 8};
int N = sizeof(arr) / sizeof(arr[0]);
bubbleSort(arr, N);
cout << "Sorted array: \n";
printArray(arr, N);
return 0;
}

//Insertion Sort

#include <bits/stdc++.h>
using namespace std;

// Function to sort an array using


// insertion sort
void insertionSort(int arr[], int n)
{
int i, key, j;
for (i = 1; i < n; i++)
{
key = arr[i];
j = i - 1;

// Move elements of arr[0..i-1],


// that are greater than key, to one
// position ahead of their
// current position
while (j >= 0 && arr[j] > key)
{
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}

// A utility function to print an array


// of size n
void printArray(int arr[], int n)
{
int i;
for (i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}

// Driver code
int main()
{
int arr[] = { 12, 11, 13, 5, 6 };
int N = sizeof(arr) / sizeof(arr[0]);

insertionSort(arr, N);
printArray(arr, N);

return 0;
}
// This is code is contributed by rathbhupendra

You might also like