Questions

A stupa is a mound-like or hemispherical structure containing relics that is used as a place of meditation.Buddhist sources claim that during the 3rd century BCE, the Mauryan Emperor Ashoka the Great ordered these eight stupas to be opened, further distributed the relics of the Buddha into 84,000 portions, and had stupas built over them all over the expanding Buddhist world.They were located on trade routes in order to propagate Buddhism.However, there were no evidence of them being located in rural areas.

TRAP, RST7.5, RST6.5, RST5.5, INTR.

It refers to the possibility for an investor to experience  losses due to  factors that affect the overall performance of the financial markets. Market risk cannot be eliminated through diversification, though it can be hedged against. The sources of market risk include natural disasters, recessions, political turmoil, changes in interest rates and terrorist attacks.

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is called path.

Fratricide means the accidental killing of one's own forces in war.

Failures in the direct fire control plan can lead to be a cause of fratricide.

#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