Index: src/tests/.expect/searchsort.txt
===================================================================
--- src/tests/.expect/searchsort.txt	(revision 707446a4ee2e0e188dd4c8436a1129db08e4e382)
+++ src/tests/.expect/searchsort.txt	(revision 8396044dbdbe93e1498949c9c4f4104fce07296d)
@@ -1,4 +1,6 @@
 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
+
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 
+10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
Index: src/tests/searchsort.c
===================================================================
--- src/tests/searchsort.c	(revision 707446a4ee2e0e188dd4c8436a1129db08e4e382)
+++ src/tests/searchsort.c	(revision 8396044dbdbe93e1498949c9c4f4104fce07296d)
@@ -10,10 +10,13 @@
 // Created On       : Thu Feb  4 18:17:50 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sat Apr  1 19:10:12 2017
-// Update Count     : 62
+// Last Modified On : Sun Apr  2 11:29:30 2017
+// Update Count     : 76
 // 
 
 #include <fstream>
 #include <stdlib>										// bsearch, qsort
+#include <stdlib.h>										// C version of bsearch
+
+int comp( const void * t1, const void * t2 ) { return *(int *)t1 < *(int *)t2 ? -1 : *(int *)t2 < *(int *)t1 ? 1 : 0; }
 
 int main( void ) {
@@ -25,8 +28,16 @@
 		sout | iarr[i] | ", ";
 	} // for
-	sout | endl;
+	sout | endl | endl;
+
+	// ascending sort/search by changing < to >
 	qsort( iarr, size );
 	for ( unsigned int i = 0; i < size; i += 1 ) {
 		sout | iarr[i] | ", ";
+	} // for
+	sout | endl;
+	for ( unsigned int i = 0; i < size; i += 1 ) {		// C version
+		int key = size - i;
+		int *v = bsearch( &key, iarr, size, sizeof( iarr[0] ), comp );
+		sout | *v | ", ";
 	} // for
 	sout | endl;