Example 1
#include <iostream>
using namespace std;
int A[6]={1, 5, 7, 9, 16, 22}, B[4]={2, 3, 4, 8}, C[10];
void merge(int counta, int countb, int &countc){
        int i=0, j=0, k=0;
        while (i<counta&&j<countb){
                if (A[i] < B[j]){
                        C[k] = A[i];
                        k++;
                        i++;
                }
                else{
                        C[k] = B[j];
                        k++;
                        j++;
                }
        }
        if (i==counta){
                while (j<countb){
                        C[k] = B[j];
                        k++;
                        j++;
                }
        }
        else{
                while (i<counta){
                        C[k] = A[i];
                        k++;
                        i++;
		    }
        }
        countc = counta + countb;					
}
int main(){
        int counta=6, countb=4, countc, i;
        merge(counta, countb, countc);
        for (i=0; i<countc; i++)        // print array C
                cout << C[i] << " ";
        cout << endl;
    return 0;
}

Example 2
#include<iostream>

using namespace std;

int search(int *number, int x, int n){
  int i=0;
  while ((number[i]!=x) && (i<n))
    i++;
  return i;
}


int main()
{
  int i, x, n=10;
  int number[10]={36, 81, 45, 17, 69, 3, 23, 92, 70, 54};

  while (true)
  {
    cout << "Number = ";
    cin>>x; 

    i=search(number,x,n);
    cout << i << n << endl;
    if (i == n)
      cout << "Not found" << endl;
    else
      cout << "Index = " << i << endl;
    }
    return 0;
}

Example 3

#include <iostream>

using namespace std;

int A[10]={3, 17, 23, 36, 45, 54, 69, 70, 81, 92};

int binary_search(int count, int target){
        int left, right, middle;
        left = 0;
        right = count-1;
        do {
                middle = (left + right) / 2;
                if (target == A[middle])
                        return middle;
                else if (target > A[middle])
                        left = middle + 1;
                else
                        right = middle -1;
        } while (left <= right);
        return count;
}

int main(void){
        int count=10, index, target;
        while (1){
                cout << "Number = ";
                cin >> target;
                index = binary_search(count, target);
                if (index == count)
                        cout << "Not found" << endl;
                else
                        cout << "Index = " << index << endl;
        }

        return 0;
}

Example 4
#include <iostream>
using namespace std;
#define n 6
void sort(int *number){
  int i, j, temp;
  for (i=0; i<n-1; i++)              // Bubble Sort
    for (j=0; j<n-i-1; j++)
      if (number[j] > number[j+1])
      {
        temp = number[j];
        number[j] = number[j+1];
        number[j+1] = temp;
      }
}
int main(void){
        int number[n]={36, 81, 45, 17, 69, 3};
        int i;
        sort(number);
        for (i=0; i<n; i++)
                cout << number[i] << " ";
        cout << endl;
        return 0;
}
Example 5
#include <iostream>
using namespace std;
#define n 6
void insertion_sort(int *number);

int main(void){
        int number[n]={81,69,45,36,17,3};
        int i;
        insertion_sort(number);
        for (i=0; i<n; i++)
                cout << number[i] << " ";
        cout << endl;
        return 0;
}

void insertion_sort(int *number){
        int i, j, key;
        for (i=1; i<n; i++){
                key = number[i];
                j = i - 1;
                while ((j >= 0) && (number[j] > key)){
                        number[j+1] = number[j];
                        j--;
                }
                number[j+1] = key;
        }
}
Example 6
#include <iostream>
using namespace std;
void selectionSort(int *arr, int n) {
    int temp;
    for (int i = 0; i < n - 1; i++) {
        int minIndex = i;
        for (int j = i + 1; j < n; j++) {
            if (arr[j] < arr[minIndex]) {
                minIndex = j;
            }
        }
        temp = arr[i];
        arr[i]=arr[minIndex];
        arr[minIndex]=temp;
    }
}
int main() {
    int numbers[] = {81, 69, 45, 36, 17, 3};
    int n = 6;

    selectionSort(numbers, n);

    cout << "Sorted array: ";
    for (int i = 0; i < n; i++) {
        cout << numbers[i] << " ";
    }
    cout << endl;

    return 0;
}

example 7
#include <iostream>
using namespace std;

int factorial(int n){
  if(n==1)
    return 1;
  else
    return n*factorial(n-1);
}
int main(){
  int i=4;
  cout << i << "! = " << factorial(i) << endl;
  return 0;
}

Example 8
#include<iostream>

using namespace std;

#define n 8  

void mergesort(int [], int, int);
void merge(int [], int, int, int);

int main(void){
        int number[n]={36, 81, 45, 17, 69, 3, 23, 92};
        int i;
        mergesort(number, 0, n-1);                              
        for (i=0; i<n; i++)
                cout << number[i] << " ";
        cout << endl;
        return 0;
}

void merge(int A[], int left, int right, int middle){
        int C[50], i, j, k;
        i = left;
        j = middle + 1;
        k = left;
        while ((i <= middle) && (j <= right)){
                if (A[i] < A[j])
                        C[k++] = A[i++];
                else
                        C[k++] = A[j++];
        }
        while (i <= middle)
                C[k++] = A[i++];
        while (j <= right)
                C[k++] = A[j++];
        for (i=left; i<k; i++)
                A[i] = C[i];
}
void mergesort(int A[], int left, int right){
        int middle;
        if(left < right){
                middle = (left + right) / 2;
                mergesort(A, left, middle);
                mergesort(A, middle+1, right);
                merge(A, left, right, middle);
        }
 }

Example 9
#include<iostream>
using namespace std;
#define n 9
void quickSort(int [], int, int);
int partition(int [], int, int);
int main(void){
  int number[n]={6,9,7,12,5,3,4,1,2};
  int i;
  quickSort(number, 0, n-1);            // Quick Sort
  for (i=0; i<n; i++)
    cout << number[i] << " ";
  cout << endl;
  return 0;
}
void quickSort(int A[], int left, int right){
        int index = partition(A, left, right);
        if (left < index - 1)
                quickSort(A, left, index - 1);
        if (index < right)
                quickSort(A, index, right);
}
int partition(int A[], int left, int right){
        int pivot = A[(left + right) / 2];
        int i = left, j = right;
        int temp;
        while (i <= j){
                while (A[i] < pivot)
                        i++;
                while (A[j] > pivot)
                        j--;
                if (i <= j){
                        temp = A[i];
                        A[i] = A[j];
                        A[j] = temp;
                        i++;
                        j--;
                }
        }
        return i;
}