diff --git a/include/acceleration_structures/box.hpp b/include/acceleration_structures/box.hpp
index 51c0b78..64026fd 100644
--- a/include/acceleration_structures/box.hpp
+++ b/include/acceleration_structures/box.hpp
@@ -22,5 +22,9 @@ class Box {
 
   // Create a box to which points can be correctly added using Include_Point.
   void Make_Empty();
+
+  vec3 Get_Size();
+
+  vec3 Get_Center();
 };
 #endif
diff --git a/src/acceleration_structures/box.cpp b/src/acceleration_structures/box.cpp
index 16eb2b1..6d80574 100644
--- a/src/acceleration_structures/box.cpp
+++ b/src/acceleration_structures/box.cpp
@@ -61,3 +61,8 @@ void Box::Make_Empty() {
   lo.fill(std::numeric_limits<double>::infinity());
   hi = -lo;
 }
+
+// Get the size of the box
+vec3 Box::Get_Size() { return hi - lo; }
+
+vec3 Box::Get_Center() { return .5 * (hi + lo); }
diff --git a/src/acceleration_structures/hierarchy.cpp b/src/acceleration_structures/hierarchy.cpp
index 2a350c4..f954485 100644
--- a/src/acceleration_structures/hierarchy.cpp
+++ b/src/acceleration_structures/hierarchy.cpp
@@ -8,10 +8,46 @@
 // You may want to implement box.cpp first.
 void Hierarchy::Reorder_Entries() {
   if (!entries.size()) return;
-  // sort based on bounding box lo, kinda stupid. But a start
-  std::sort(entries.begin(), entries.end(), [](Entry first, Entry second) {
-    return first.box.lo[1] < second.box.lo[1];
-  });
+
+  vec3 sum;
+  for (Entry entry : entries) {
+    sum += entry.box.Get_Center();
+  }
+
+  vec3 mean = sum / entries.size();
+
+  int furthest_index = 0;
+  double distance_squared_to_center =
+      (mean - entries[0].box.Get_Center()).magnitude_squared();
+  for (int i = 1; i < entries.size(); i++) {
+    if ((mean - entries[i].box.Get_Center()).magnitude_squared() >
+        distance_squared_to_center) {
+      furthest_index = i;
+      distance_squared_to_center =
+          (mean - entries[i].box.Get_Center()).magnitude_squared();
+    }
+  }
+
+  std::swap(entries[0], entries[furthest_index]);
+
+  int nearest_index;
+  double nearest_distance;
+  for (int i = 0; i < (int)entries.size() - 2; i++) {
+    nearest_index = i + 1;
+    nearest_distance =
+        (entries[i].box.Get_Center() - entries[nearest_index].box.Get_Center())
+            .magnitude_squared();
+    for (int j = i + 2; j < entries.size(); j++) {
+      if ((entries[i].box.Get_Center() - entries[j].box.Get_Center())
+              .magnitude_squared() < nearest_distance) {
+        nearest_index = j;
+        nearest_distance =
+            (entries[i].box.Get_Center() - entries[j].box.Get_Center())
+                .magnitude_squared();
+      }
+    }
+    std::swap(entries[i + 1], entries[nearest_index]);
+  }
 }
 
 // Populate tree from entries.