--- a/functions.h	Fri Mar 03 19:42:09 2006 +0000
+++ b/functions.h	Fri Mar 03 20:43:54 2006 +0000
@@ -263,6 +263,5 @@
 
 void DeterminePaths(void);
 
-void bubblesort(void *base, size_t nmemb, size_t size, int(*compar)(const void *, const void *));
 void CSleep(int milliseconds);
 #endif /* FUNCTIONS_H */

--- a/misc.c	Fri Mar 03 19:42:09 2006 +0000
+++ b/misc.c	Fri Mar 03 20:43:54 2006 +0000
@@ -609,35 +609,6 @@
 	return i;
 }
 
-//!We're writing an own sort algorithm here, as
-//!qsort isn't stable
-//!Since the number of elements will be low, a
-//!simple bubble sort will have to do :)
-
-void bubblesort(void *base, size_t nmemb, size_t size, int(*compar)(const void *, const void *))
-{
-	uint i,k;
-	void *buffer = malloc(size);
-	char *start = base;
-
-	nmemb--;
-
-	for (i = 0; i < nmemb; i++) {
-		for (k = 0; k < nmemb; k++) {
-			void *a, *b;
-			a = start + size * k;
-			b = start + size * (k + 1);
-			if (compar(a, b) > 0) {
-				memcpy(buffer, a, size);
-				memcpy(a, b, size);
-				memcpy(b, buffer, size);
-			}
-		}
-	}
-
-	free(buffer);
-	buffer = NULL;
-}
 
 static void Save_NAME(void)
 {