├── 2.	Selection sort algorithm using c++
├── Bubble sort  algorithm in datastructures using c++
├── Insertion sort algorithm in datastructures using c++
└── Merge sort algorithm in data structures using c++


/2.	Selection sort algorithm using c++:
--------------------------------------------------------------------------------
 1 | #include<iostream>
 2 | using namespace std;
 3 | void swapping(int &a, int &b)
 4 | {
 5 | int temp; temp = a; a = b;
 6 | b = temp;
 7 | }
 8 | void display(int *array, int size) 
 9 | { for(int i = 0; i<size; i++)
10 | cout << array[i] << " ";
11 | cout << endl;
12 | }
13 | void selectionSort(int *array, int size)
14 | { int i, j, imin;
15 | for(i = 0; i<size-1; i++)
16 | {
17 | imin = i;
18 | for(j = i+1; j<size; j++)
19 | {
20 | if(array[j] < array[imin])
21 | { imin = j;
22 | swap(array[i], array[imin]); }
23 | }
24 | }
25 | int main()
26 | {
27 | int n;
28 |  
29 | cout << "Enter the number of elements: "; 
30 | cin >> n;
31 | int arr[n];
32 | cout << "Enter elements:" << endl;
33 | for(int i = 0; i<n; i++)
34 | {
35 | cin >> arr[i];
36 | }
37 | cout << "Array before Sorting: ";
38 | display(arr, n);
39 | selectionSort(arr, n);
40 | cout << "Array after Sorting: "; 
41 | display(arr, n);
42 | }
43 | 


--------------------------------------------------------------------------------
/Bubble sort  algorithm in datastructures using c++:
--------------------------------------------------------------------------------
 1 | #include <iostream.h>
 2 | using namespace std;
 3 | void BubbleSort (int arr[], int n)
 4 | {
 5 | int i, j;
 6 | for (i = 0; i < n; ++i)
 7 | {
 8 | for (j = 0; j < n-i-1; ++j)
 9 | {
10 | if (arr[j] > arr[j+1])
11 | {
12 | arr[j] = arr[j]+arr[j+1];
13 | arr[j+1] = arr[j]-arr[j + 1];
14 | arr[j] = arr[j]-arr[j + 1];
15 | }
16 | }
17 | }
18 | }
19 | int main()
20 | {
21 | int n, i;
22 | cout<<"\nEnter the number of data element to be sorted: "; cin>>n;
23 | int arr[n];
24 | for(i = 0; i < n; i++)
25 | {
26 | cout<<"Enter element "<>arr[i];
27 | }
28 | BubbleSort(arr, n); cout<<"\nSorted Data "; for (i = 0; i < n; i++) cout<<"->"<<arr[i]; return 0;
29 | }
30 | 


--------------------------------------------------------------------------------
/Insertion sort algorithm in datastructures using c++:
--------------------------------------------------------------------------------
 1 | #include <bits/stdc++.h>
 2 | void insertionSort(int arr[], int n)
 3 | {
 4 | int i, key, j;
 5 | for (i = 1; i < n; i++)
 6 | {
 7 | key = arr[i]; j = i - 1;
 8 | 
 9 | while (j >= 0 && arr[j] > key)
10 | {
11 | arr[j + 1] = arr[j]; j = j - 1;
12 | }
13 | arr[j + 1] = key;
14 | }
15 | }
16 | void printArray(int arr[], int n)
17 | {
18 | int i;
19 | for (i = 0; i < n; i++) cout << arr[i] << " ";
20 | cout << endl;
21 | }
22 | int main()
23 | {
24 | int arr[] = { 12, 11, 13, 5, 6 };
25 | int n = sizeof(arr) / sizeof(arr[0]);
26 | insertionSort(arr, n); printArray(arr, n);
27 | return 0;
28 | }
29 | 


--------------------------------------------------------------------------------
/Merge sort algorithm in data structures using c++:
--------------------------------------------------------------------------------
 1 | #include<iostream.h>
 2 | using namespace std;
 3 | void swapping(int &a, int &b)
 4 | {
 5 | int temp; temp = a; a = b;
 6 | b = temp;
 7 | }
 8 | void display(int *array, int size)
 9 | {
10 | for(int i = 0; i<size; i++)
11 | cout << array[i] << " ";
12 | cout << endl;
13 | }
14 | void merge(int *array, int l, int m, int r)
15 | {
16 | int i, j, k, nl, nr;
17 | nl = m-l+1; nr = r-m; int larr[nl], rarr[nr];
18 | for(i = 0; i<nl; i++)
19 | {
20 | array[i] = array[l+i];
21 | for(j = 0; j<nr; j++)
22 | {
23 | array[j] = array[m+1+j];
24 | i = 0;
25 | j = 0;
26 | k = l;
27 | while(i < nl && j<nr)
28 | {
29 | if(larr[i] <= rarr[j])
30 | {
31 | array[k] = larr[i]; i++;
32 | }
33 | else{
34 | array[k] = rarr[j]; j++;
35 | } k++;
36 | }
37 | while(i<nl) { array[k] = larr[i]; i++; k++;
38 | }
39 | while(j<nr) { array[k] = rarr[j]; j++; k++;
40 | }
41 | }
42 | void mergeSort(int *array, int l, int r)
43 | {
44 | int m; if(l < r) {
45 | int m = l+(r-l)/2; mergeSort(array, l, m); mergeSort(array, m+1, r); merge(array, l, m, r);
46 | }
47 | }
48 | int main()
49 | {
50 | int n;
51 | cout << "Enter the number of elements: "; cin >> n;
52 | int arr[n];
53 | cout << "Enter elements:" << endl; for(int i = 0; i<n; i++) {
54 | cin >> arr[i];
55 | cout << "Array before Sorting: "; display(arr, n);
56 |  
57 | mergeSort(arr, 0, n-1);
58 | cout << "Array after Sorting: "; display(arr, n);
59 | }
60 | 
61 | 


--------------------------------------------------------------------------------