------------------------------------------ NEEHARIKA VEMPALLY --------------------------------------------------------



#include<stdio.h>
#include <stdarg.h>
#include<stdlib.h>

int compare (const void * a, const void * b){	//This function will compare 2 integers
        return ( *(int*)a - *(int*)b );			//and is required by qsort.
}

int find_number(int *check, int num, int number){
        int i;
        for(i=0; i<num; i++){
                if(check[i] == number)
                        return i;
        }
        return -1;
}

void check(int num, ...){	//This function will printout the sequence of evaluation.
        int i;
        int vars[num];
        int check[num];
        va_list argp;
        va_start(argp, num);
        for(i=0; i<num; i++){		//Read in all the parameters in 2 lists, one for quick sort
                int temp = va_arg(argp, int);	//and other for finding.
                vars[i]=temp;
                check[i]=temp;
        }
        va_end(argp);
						//Perform quicksort on the list and this will sort by
        qsort(vars, num, sizeof(int), compare);	//low to high and hence the evaluation sequence

        printf("Evaluation Sequence: ");
        for(i=0; i<num; i++){
                int number=vars[i];
                printf("%d ", find_number(check, num, number));	//Find the number in the original
        }								//parameter list								
        printf("\n");
}

void f(int a, int b, int c, int d, int e){
        check(5, a, b, c, d, e);	//Call the function check with first the number of arguments
}				//then with the arguments

int main(){
        int a=10;
        f(a++, a++, a++, a++, a++);	//Call the function f
        return 0;
}