Questions

In the summit clash of the 37th and final edition of the Hockey Champions Trophy at Breda, the Netherlands, India lost to defending champions Australia via penalty shoot-off. The match went into the shoot-off after both the teams were locked at 1-1 in regulation time.

According to Rayleigh's law, the intensity of scattered light varies inversely as the fourth power of its wavelength. Sunlight consists of seven colours. Of these, red has the maximum wavelength. During sunrise and sunset, the rays have to travel a larger part of the atmosphere because they are very close to the horizon.Therefore, light other than red is mostly scattered away. Most of the red light, which is the least scattered, enters our eyes. Hence, the sun and the sky appear red.

Wavelength of a wave can be measured with the distance between two nearest crest and crest or nearest troughs. It is measured as armstrong units.

Dr. B.R. Ambedkar received Bharat Ratna in the year 1990.

Capitalism is an economic system followed by a country or a society which is characterized by Privately owned businesses, a market economy and profits.

Capitalism is defined as "production for exchange" driven by the desire for personal accumulation of money receipts in such exchanges, mediated by free markets. The markets themselves are driven by the needs and wants of consumers and those of society as a whole in the form of the bourgeois state.

#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