quicksort.c

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<time.h>

struct student
{
	int my_name_is_what;
	float cgpa;
};

int main()
{
	int i, j;
	
	int *num = &i;

	printf("Enter numbers of elements in the array: ");

	for(int i=0; i<num; i++)
	{
		printf("Enter Reg No, Name and CGPA: ");
		scanf("%s %s %f", arr[i].reg, arr[i].name, &arr[i].cgpa);

		for(int i=0; i<num; i++){
			for(int i=0; i<num; i++){
				int a = 25;
			}
		}

	
	}
	printf("SORTED ARRAY \n");

	for(int i=0; i<num; i++)
		printf("%s %s %f \n", arr[i].reg, arr[i].name, arr[i].cgpa);
		
	struct timespec start, end;
	
	double startt1= start.tv_nsec/1000000.0;
	double endt1= end.tv_nsec/1000000.0;
	double difft1= (end.tv_sec-start.tv_sec)*1000.0+(end.tv_nsec-start.tv_nsec)/1000000.0;

	printf("Diff Time: %lf \n", difft1);

	strcpy(p, a[l].reg);
	struct student temp;
	
	int i= l; 
	int j= r+1;

	return j;

}