Questions

To get the mass of a mole of NaCl, we need to add the molar atomic weights of the individual elements i.e, Na and Cl

Atomic weights of Na = 22.99 gm/mol  Cl = 35.45 gm/mol

Now, mass of a mole of NaCl = 22.99 + 35.45 = 58.44 gm/mol.

1. A fixed budget is established for a specific level of activity whereas flexible budget is prepared for various levels of activity.

2. Fixed budget cannot be changed after the period commences, whereas a flexible budget can be changed after the period commence.

3. Fixed budget is more suitable for fixed expenses whereas flexible budget takes both fixed as well as variable expenses in account.

4. Fixed budget includes only fixed costs, whereas a flexible budget includes fixed costs, variable costs and semi variable costs.

5. Fixed budget is mainly used in planning stage whereas flexible budget is used in controlling stage.

On election day, voters for The President are really voting for the electors who can elect President.

#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

Amazon Rainforest Forests are located in South America.