From e2cd7a51e55fea6bbc5f23080bda6de1ca951c8b Mon Sep 17 00:00:00 2001
From: Eli Barzilay <eli@racket-lang.org>
Date: Thu, 19 Nov 2009 21:58:44 +0000
Subject: [PATCH] Fixed a comparison that was too strict, making the code go to
 the general case on lists of length 3.  (Didn't have much effect since it's
 only the toplevel comparison).

svn: r16899
---
 collects/scheme/private/sort.ss | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/collects/scheme/private/sort.ss b/collects/scheme/private/sort.ss
index b6b3060723..dcc9546366 100644
--- a/collects/scheme/private/sort.ss
+++ b/collects/scheme/private/sort.ss
@@ -154,7 +154,7 @@
        lst]
       ;; below we can assume an unsorted list
       ;; inlined case, for optimization of short lists
-      [(< n 3)
+      [(<= n 3)
        (if (= n 2)
          ;; (because of the above test, we can assume that the input is
          ;; unsorted)