Questions

The fall of the Czar is known as February Revolution because, according to the old Russian calender, it occured on 27 February 1917.

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.

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.

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.

Jay Cooke & Company, a major component of the United States banking establishment, found itself unable to market several million dollars in Northern Pacific Railway bonds in september 1873. Cooke's firm, like many others, had invested heavily in the railroads.

Hence, the bankruptcy of Jay Cooke & company initiated the Panic of 1873.

#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