Questions

Oxygen deficiency or decreased oxygen levels in the blood is a condition known as Hypoxemia.

Hypercapnia means High carbon dioxide levels in the blood.

IC's (Integrated Circuits) also called as Chips or Microchips whose invention allowed computers to be smaller and smaller.

TABC stands for Texas Alcoholic Beverage Commission. The Texas Alcoholic Beverage Commission regulates the sales, taxation, production, trade, and advertising of alcoholic beverages in Texas. Alcohol Seller/server Training regulated by this regulatory body is also called TABC Certification. It makes the rules the rest of us have to follow, and if you want to get a job serving alcohol in Texas, getting TABC certified is your first step.

Karst topography is a landscape formed from the dissolution of soluble rocks such as limestone, dolomite, and gypsum.

A rotating column of air is called as a Tornado which extends from the thunderstorm to the ground.

#include
#define MAX 50

void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);

int main(){
  
    int merge[MAX],i,n;

    printf("Enter the total number of elements: ");
    scanf("%d",&n);

    printf("Enter the elements which to be sort: ");
    for(i=0;i<n;i++){
         scanf("%d",&merge[i]);
    }

    partition(merge,0,n-1);

    printf("After merge sorting elements are: ");
    for(i=0;i<n;i++){
         printf("%d ",merge[i]);
    }

   return 0;
}

void partition(int arr[],int low,int high){

    int mid;

    if(low<high){
         mid=(low+high)/2;
         partition(arr,low,mid);
         partition(arr,mid+1,high);
         mergeSort(arr,low,mid,high);
    }
}

void mergeSort(int arr[],int low,int mid,int high){

    int i,m,k,l,temp[MAX];

    l=low;
    i=low;
    m=mid+1;

    while((l<=mid)&&(m<=high)){

         if(arr[l]<=arr[m]){
             temp[i]=arr[l];
             l++;
         }
         else{
             temp[i]=arr[m];
             m++;
         }
         i++;
    }

    if(l>mid){
         for(k=m;k<=high;k++){
             temp[i]=arr[k];
             i++;
         }
    }
    else{
         for(k=l;k<=mid;k++){
             temp[i]=arr[k];
             i++;
         }
    }
  
    for(k=low;k<=high;k++){
         arr[k]=temp[k];
    }
}


Sample output:

Enter the total number of elements: 5
Enter the elements which to be sort: 2 5 0 9 1
After merge sorting elements are: 0 1 2 5 9