From 55898fc40184886d2ee9570c7c1f8e2eca63e2ca Mon Sep 17 00:00:00 2001
From: Steve Hollasch <steve@hollasch.net>
Date: Sat, 11 Apr 2020 19:32:27 -0700
Subject: [PATCH] Remove obsolete paragraph about using qsort

We're using `std::sort` now.

Resolves #462
---
 books/RayTracingTheNextWeek.html | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/books/RayTracingTheNextWeek.html b/books/RayTracingTheNextWeek.html
index 8c72048b..373c6774 100644
--- a/books/RayTracingTheNextWeek.html
+++ b/books/RayTracingTheNextWeek.html
@@ -769,11 +769,6 @@
 
 </div>
 
-I used the old-school C `qsort` rather than the C++ sort because I need a different compare operator
-depending on axis, and `qsort` takes a compare function rather than using the less-than operator. I
-pass in a pointer to pointer -- this is just C for “array of pointers” because a pointer in C can
-also just be a pointer to the first element of an array.
-
 <div class='together'>
 When the list coming in is two elements, I put one in each subtree and end the recursion. The
 traverse algorithm should be smooth and not have to check for null pointers, so if I just have one