Improve quick sort

C/projecteuler.c

@@ -2,6 +2,8 @@
 #include <math.h>
 #include "projecteuler.h"
 
+int partition(void **array, int l, int r, int (*cmp)(void *lv, void *rv));
+
 int is_prime(long int num)
 {
    int i, limit;
@@ -129,29 +131,81 @@ int count_divisors(int n)
    return count;
 }
 
-void quick_sort(void **array, int l, int r, int (*cmp)(void *lv, void *rv))
+void insertion_sort(void **array, int l, int r, int (*cmp)(void *lv, void *rv))
 {
    int i, j;
-   void *pivot, *tmp;
+   void *tmp;
    
-   if (l >= r) return;
+   for(i = r; i > l; i--)
-
+   {
-   pivot = array[l];
+      if(cmp(array[i], array[i-1]) < 0)
-   i = l - 1;
+      {
-   j = r + 1;
-
-   while (i < j) {
-
-      while (cmp(array[++i], pivot) < 0);
-      while (cmp(array[--j], pivot) > 0);
-
-      if (i < j) {
          tmp = array[i];
-         array[i] = array[j];
+         array[i] = array[i-1];
-         array[j] = tmp;
+         array[i-1] = tmp;
       }
    }
+   for(i = l + 2; i <= r; i++)
+   {
+      tmp = array[i];
+      j = i;
 
-   quick_sort(array, l, j, cmp);
+      while(cmp(tmp, array[j-1]) < 0)
-   quick_sort(array, j+1, r, cmp);
+      {
+         array[j] = array[j-1];
+         j--;
+      }
+      
+      array[j] = tmp;
+   }
+}
+
+int partition(void **array, int l, int r, int (*cmp)(void *lv, void *rv))
+{
+   int i = l -1, j = r;
+   void *pivot, *tmp;
+   
+   pivot = array[r];
+   
+   while(1)
+   {
+      while(cmp(array[++i], pivot) < 0);
+      while(cmp(array[--j], pivot) > 0)
+      {
+         if(j == l)
+         {
+            break;
+         }
+      }
+
+      if(j <= i)
+      {
+         break;
+      }
+
+      tmp = array[i];
+      array[i] = array[j];
+      array[j] = tmp;
+   }
+
+   tmp = array[i];
+   array[i] = array[r];
+   array[r] = tmp;
+   
+   return i;
+}
+
+void quick_sort(void **array, int l, int r, int (*cmp)(void *lv, void *rv))
+{
+   int i;
+   
+   if(r - l <= 10)
+   {
+      insertion_sort(array, l, r, cmp);
+      return;
+   }
+   
+   i = partition(array, l, r, cmp);
+   quick_sort(array, l, i-1, cmp);
+   quick_sort(array, i+1, r, cmp);
 }

C/projecteuler.h

@@ -7,6 +7,7 @@ long int lcm(long int a, long int b);
 long int gcd(long int a, long int b);
 int *sieve(int n);
 int count_divisors(int n);
+void insertion_sort(void **array, int l, int r, int (*cmp)(void *lv, void *rv));
 void quick_sort(void **array, int l, int r, int (*cmp)(void *lv, void *rv));
 
 #endif