From 0d077293a5428c0e5b6655f6ffc2cb27b2cba97b Mon Sep 17 00:00:00 2001
From: "erwin.coumans" <erwin.coumans@08e121b0-ae19-0410-a57b-3be3395fd4fd>
Date: Thu, 22 Mar 2012 17:43:17 +0000
Subject: [PATCH] use heap sort instead of quicksort

---
 Demos/VoronoiFractureDemo/VoronoiFractureDemo.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Demos/VoronoiFractureDemo/VoronoiFractureDemo.cpp b/Demos/VoronoiFractureDemo/VoronoiFractureDemo.cpp
index d3dca4cee..a7d074752 100644
--- a/Demos/VoronoiFractureDemo/VoronoiFractureDemo.cpp
+++ b/Demos/VoronoiFractureDemo/VoronoiFractureDemo.cpp
@@ -178,7 +178,7 @@ void VoronoiFractureDemo::getVerticesInsidePlanes(const btAlignedObjectArray<btV
 	}
 }
 
-static btVector3 curVoronoiPoint; // Here for btAlignedObjectArray.quickSort pointCmp scope
+static btVector3 curVoronoiPoint; 
 
 struct pointCmp
 {
@@ -230,7 +230,7 @@ void VoronoiFractureDemo::voronoiBBShatter(const btAlignedObjectArray<btVector3>
 		planes[4] = -bbvy; planes[4][3] = nrbb.y();
 		planes[5] = -bbvz; planes[5][3] = nrbb.z();
 		maxDistance = SIMD_INFINITY;
-		sortedVoronoiPoints.quickSort(pointCmp());
+		sortedVoronoiPoints.heapSort(pointCmp());
 		for (j=1; j < numpoints; j++) {
 			normal = sortedVoronoiPoints[j] - curVoronoiPoint;
 			nlength = normal.length();
@@ -375,7 +375,7 @@ void VoronoiFractureDemo::voronoiConvexHullShatter(const btAlignedObjectArray<bt
 			planes[j][3] += planes[j].dot(curVoronoiPoint);
 		}
 		maxDistance = SIMD_INFINITY;
-		sortedVoronoiPoints.quickSort(pointCmp());
+		sortedVoronoiPoints.heapSort(pointCmp());
 		for (j=1; j < numpoints; j++) {
 			normal = sortedVoronoiPoints[j] - curVoronoiPoint;
 			nlength = normal.length();