heimoshuiyu/dsa
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

week8 format

Browse Source
This commit is contained in:
黑墨水鱼
2021-04-29 15:24:27 +08:00
parent 5fb1ec5cef
commit 968416e919
2 changed files with 33 additions and 37 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
week8/quicksort.c
View File

@@ -151,13 +151,11 @@ bool Check(int *A, int size) {
} }
void PrintClockInterval(clock_t start, clock_t end) { void PrintClockInterval(clock_t start, clock_t end) {
printf("the time cost of this algorithms is %ld ms\n", (end - start) / (CLOCKS_PER_SEC / 1000)); printf("the time cost of this algorithms is %ld ms\n",
(end - start) / (CLOCKS_PER_SEC / 1000));
} }
/* use this to check small size of data */ /* use this to check small size of data */
void _PrintClockInterval(clock_t start, clock_t end) { void _PrintClockInterval(clock_t start, clock_t end) {
printf("the time cost of this algorithms is %ld ms\n", (end - start)); printf("the time cost of this algorithms is %ld ms\n", (end - start));
} }

6
week8/quicksort.h
View File

@@ -1,9 +1,8 @@
#include <stdbool.h> #include <stdbool.h>
#include <time.h> #include <time.h>
/* Sort array A[left..right] using quick sort
/* Sort array A[left..right] using quick sort */ * Pivot is picked using median-of-3 */
/* Pivot is picked using median-of-3 */
void QuickSort(int *A, int left, int right); void QuickSort(int *A, int left, int right);
/* Sort the array in order */ /* Sort the array in order */
@@ -23,4 +22,3 @@ void PrintClockInterval(clock_t start, clock_t end);
/* use this to check small size of data */ /* use this to check small size of data */
void _PrintClockInterval(clock_t start, clock_t end); void _PrintClockInterval(clock_t start, clock_t end);