Questions

The Moscow Metro in Russia carries 8-9 million passengers each day. By comparison, the New york City Subway, USA carries 4.5 million people each day and the London underground , UK, carries just over 3 million.

Metamorphism is the method of changing the structure of a rock by using heat and temperature.

Hence, for this to happen the parent rock must be in solid form only. Therefore, option C) is true.

It is the letter 'e', that is the first on earth, the second in heaven.

It appears twice in a week, that appears once in a year.

No. Boiling water is not a chemical change. Because in this process it doesn't loss its properties. It just changes its state i.e, from liquid state to gaseous.

Hence, Boiling water is a Physiacl change and not a chemical change.

Our atmosphere is made up of

78% Nitrogen,

21% Oxygen and

1% all other gases like argon, carbon dioxide, neon, and helium.

So, Nitrogen makes up the majority of our atmosphere.

In national income accounting, government purchases by Local, State and Federal governments.

#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