Index: src/examples/constants.c
===================================================================
--- src/examples/constants.c	(revision 984dce6bb5af39c6108d6d825e085c449dc9f3ad)
+++ src/examples/constants.c	(revision 94980502bd2ac684358a902199d886fd8340a709)
@@ -10,6 +10,6 @@
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Jan 25 23:44:12 2016
-// Update Count     : 76
+// Last Modified On : Fri Mar 11 16:27:38 2016
+// Update Count     : 81
 //
 
@@ -44,5 +44,5 @@
 	0x_ff_FF_ff_FF_ff_FF_ff_FF;
 	9_223_372_036_854_775_807;
-	18_446_744_073_709_551_615;
+	18_446_744_073_709_551_615UL;
 	3.141_59f;
 	3.14159;
@@ -53,6 +53,6 @@
 	L'\x_ff_ee';
 	L_"\x_ff_ee";
-	L"a_b\r\Qyc\u_00_40  x_y_z\xff_AA";
-	L_"a_b\r\Qyc\u_00_40\
+	L"a_b\r\vyc\u_00_40  x_y_z\xff_AA";
+	L_"a_b\r\vyc\u_00_40\
   x_y_z\xff_AA";
 	"abc" "def" "ghi";
Index: src/examples/limits.c
===================================================================
--- src/examples/limits.c	(revision 984dce6bb5af39c6108d6d825e085c449dc9f3ad)
+++ src/examples/limits.c	(revision 94980502bd2ac684358a902199d886fd8340a709)
@@ -98,4 +98,4 @@
 // Local Variables: //
 // tab-width: 4 //
-// compile-command: "cfa min.c" //
+// compile-command: "cfa limits.c" //
 // End: //
Index: src/examples/searchsort.c
===================================================================
--- src/examples/searchsort.c	(revision 984dce6bb5af39c6108d6d825e085c449dc9f3ad)
+++ src/examples/searchsort.c	(revision 94980502bd2ac684358a902199d886fd8340a709)
@@ -11,6 +11,6 @@
 // Created On       : Thu Feb  4 18:17:50 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Feb 17 12:21:04 2016
-// Update Count     : 46
+// Last Modified On : Tue Mar 22 22:16:46 2016
+// Update Count     : 55
 // 
 
@@ -36,4 +36,24 @@
 		sout | *v | ", ";
 	} // for
+	sout | endl | endl;
+
+	// descending sort/search by changing < to >
+	for ( unsigned int i = 0; i < size; i += 1 ) {
+		iarr[i] = i + 1;
+		sout | iarr[i] | ", ";
+	} // for
+	sout | endl;
+	{
+		int ?<?( int x, int y ) { return x > y; }
+		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 ) {
+			int *v = bsearch( size - i, iarr, size );
+			sout | *v | ", ";
+		} // for
+	}
 	sout | endl | endl;