write the C code to implement this.

Sort the given dataset using following sorting algorithm and compare their performance in terms of time and space by creating a table given below:

Dataset		Quicksort	Insertion sort	Merge sort	Counting sort
Dataset1 [PRINT FILESIZE IN KBs and NUMBER OF RECORDS]	Sort by date[Vix dataset]
	Sort by price[Vix dataset]
Dataset2 [PRINT FILESIZE IN KBs and NUMBER OF RECORDS]	Sort by age[Bank dataset]
	Sort by jobs[Bank dataset]
	Sort by balance[Bank dataset]

Bank Dataset is as follows:

likewise there are 5580 records(rows). I need to know for only one sorting as how to store these data in an array and how to manipulate it.

age job marital education default balance housing loan contact day month duration campaign pdays previous poutcome deposit 0 41 services married unknown no 88 yes no cellular 11 may 105 1 336 2 failure no 1 56 technician married secondary no 1938 no yes cellular 26 feb 229 1 192 4 success yes 2 30 services single secondary no 245 no yes cellular 8 jul 187 2 -1 0 unknown no 3 34 management single tertiary no 1396 yes no cellular 17 jul 630 1 -1 0 unknown no 4 29 technician single secondary no -13 yes no cellular 14 may 512 3 -1 0 unknown no 5 26 unemployed single secondary no 632 no no cellular 12 feb 218 1 -1 0 unknown yes