Questions

 Nataraga/ Natanarayana

Like commas, semicolons indicate an audible pause — slightly longer than a comma's, but short of a period's full stop.

Rules for Semicolon ::

1. A semicolon can replace a period if the writer wishes to narrow the gap between two closely linked sentences.

2. Use a semicolon before such words and terms as namely, however, therefore, that is, i.e., for example, e.g., for instance, etc., when they introduce a complete sentence. It is also preferable to use a comma after these words and terms.

3. Avoid a semicolon when a dependent clause comes before an independent clause.

4. Use a semicolon to separate units of a series when one or more of the units contain commas.

Hence according to rule no. 2) option (C) He ate; however, he didn't sleep is correctly puctuated with a semicolon.

A morpheme is the smallest unit of a word that provides a specific meaning to a string of letters.

Genes : The DNA is the genetic material. The DNA is made of several nucleotides. A nucleotide means, one nitrogenous base one sugar molecule and a phosphate molecule. These nucleotides occur in sequences and several nucleotides form one Gene ( a functional mgene is called a cistron)

#include<stdio.h>

void quicksort(int [10],int,int);

int main(){
  int x[20],size,i;

  printf("Enter size of the array: ");
  scanf("%d",&size);

  printf("Enter %d elements: ",size);
  for(i=0;i<size;i++)
    scanf("%d",&x[i]);

  quicksort(x,0,size-1);

  printf("Sorted elements: ");
  for(i=0;i<size;i++)
    printf(" %d",x[i]);

  return 0;
}

void quicksort(int x[10],int first,int last){
    int pivot,j,temp,i;

     if(first<last){
         pivot=first;
         i=first;
         j=last;

         while(i<j){
             while(x[i]<=x[pivot]&&i<last)
                 i++;
             while(x[j]>x[pivot])
                 j--;
             if(i<j){
                 temp=x[i];
                  x[i]=x[j];
                  x[j]=temp;
             }
         }

         temp=x[pivot];
         x[pivot]=x[j];
         x[j]=temp;
         quicksort(x,first,j-1);
         quicksort(x,j+1,last);

    }
}

Output:
Enter size of the array: 5
Enter 5 elements: 3 8 0 1 2
Sorted elements: 0 1 2 3 8