diff options
| author | Milutin Jovanović <jovanovic.milutin@gmail.com> | 2012-06-18 13:27:32 -0400 |
|---|---|---|
| committer | Milutin Jovanović <jovanovic.milutin@gmail.com> | 2012-06-18 15:11:39 -0400 |
| commit | 42c1b6ba380d9d1ab85f0cc21db07e71667cc682 (patch) | |
| tree | e5eb7e317ad696d0975e463771c25c8a3c01260c /tests2/25_quicksort.c | |
| parent | b0ebcfa7bae4a8743698107a82fffc598818ccc5 (diff) | |
| download | tinycc-42c1b6ba380d9d1ab85f0cc21db07e71667cc682.tar.gz tinycc-42c1b6ba380d9d1ab85f0cc21db07e71667cc682.tar.bz2 | |
tests: Added numerous tests.
The tests are taken almost verbatim from the open source project PicoC. It can
be found at https://code.google.com/p/picoc/.
The tests range from very simple/trivial ones to more complicated. My view is
that the more tests the better. Without tests like this I was very reluctant to
make any changes to tcc for the fear of breaking things.
The tests pass on Win32, OSX, Linux x86 and x86_64. One or two tests fail on
each platform due to differences in the runtime library.
Diffstat (limited to 'tests2/25_quicksort.c')
| -rw-r--r-- | tests2/25_quicksort.c | 83 |
1 files changed, 83 insertions, 0 deletions
diff --git a/tests2/25_quicksort.c b/tests2/25_quicksort.c new file mode 100644 index 0000000..5cc08bd --- /dev/null +++ b/tests2/25_quicksort.c @@ -0,0 +1,83 @@ +#include <stdio.h> + +int array[16]; + +//Swap integer values by array indexes +void swap(int a, int b) +{ + int tmp = array[a]; + array[a] = array[b]; + array[b] = tmp; +} + +//Partition the array into two halves and return the +//index about which the array is partitioned +int partition(int left, int right) +{ + int pivotIndex = left; + int pivotValue = array[pivotIndex]; + int index = left; + int i; + + swap(pivotIndex, right); + for(i = left; i < right; i++) + { + if(array[i] < pivotValue) + { + swap(i, index); + index += 1; + } + } + swap(right, index); + + return index; +} + +//Quicksort the array +void quicksort(int left, int right) +{ + if(left >= right) + return; + + int index = partition(left, right); + quicksort(left, index - 1); + quicksort(index + 1, right); +} + +int main() +{ + int i; + + array[0] = 62; + array[1] = 83; + array[2] = 4; + array[3] = 89; + array[4] = 36; + array[5] = 21; + array[6] = 74; + array[7] = 37; + array[8] = 65; + array[9] = 33; + array[10] = 96; + array[11] = 38; + array[12] = 53; + array[13] = 16; + array[14] = 74; + array[15] = 55; + + for (i = 0; i < 16; i++) + printf("%d ", array[i]); + + printf("\n"); + + quicksort(0, 15); + + for (i = 0; i < 16; i++) + printf("%d ", array[i]); + + printf("\n"); + + return 0; +} + +/* vim: set expandtab ts=4 sw=3 sts=3 tw=80 :*/ |
