Merge sort versus quick sort performance
- by Giorgio
I have implemented merge sort and quick sort using C (GCC 4.4.3 on Ubuntu 10.04 running on a 4 GB RAM laptop with an Intel DUO CPU at 2GHz) and I wanted to compare the performance of the two algorithms.
The prototypes of the sorting functions are:
void merge_sort(const char **lines, int start, int end);
void quick_sort(const char **lines, int…