re-add other test cases - now fails constant because infinite recursion to be fixed for spsort

space_partitioning_sort/spsort.h

@@ -157,7 +157,10 @@ inline void internal_spsort(uint32_t *t, int n, int m, uint32_t low, uint32_t mi
 
 	// Re-pivot the mid if needed
 	if(lefts < m) {
+		// Left can be simple-sorted
 		binsertion_sort(t, left);
+
+		// Check the right now
 		if(rights < m) {
 			// Balance in both small-extremal
 			// means we can small-sort both.

ypsu.cpp

@@ -32,8 +32,8 @@
     worst[name] = std::max(worst[name], seconds);
   }
   std::vector<std::string> inputtypes = {
-      /*"constant", "asc",      "desc",       "ascasc", "ascdesc",
-      "descasc",  "descdesc", "smallrange",*/ "rand",
+      "constant", "asc",      "desc",       "ascasc", "ascdesc",
+      "descasc",  "descdesc", "smallrange", "rand",
   };
   std::vector<uint32_t> geninput(const std::string &type, int n) {
     std::vector<uint32_t> v(n);