From 0a30e648e06be85b3380a62ae156a9c7f343392f Mon Sep 17 00:00:00 2001
From: Tim Peters <tim.peters@gmail.com>
Date: Sat, 20 Jul 2002 04:21:51 +0000
Subject: Added new test "3sort". This is sorted data but with 3 random
exchanges. It's a little better than average for our sort.
---
Lib/test/sortperf.py | 10 +++++++++-
1 file changed, 9 insertions(+), 1 deletion(-)
diff --git a/Lib/test/sortperf.py b/Lib/test/sortperf.py
index 546afd5..cd6bbcb 100644
--- a/Lib/test/sortperf.py
+++ b/Lib/test/sortperf.py
@@ -74,12 +74,13 @@ def tabulate(r):
*sort: random data
\sort: descending data
/sort: ascending data
+ 3sort: ascending data but with 3 random exchanges
~sort: many duplicates
=sort: all equal
!sort: worst case scenario
"""
- cases = ("*sort", "\\sort", "/sort", "~sort", "=sort", "!sort")
+ cases = ("*sort", "\\sort", "/sort", "3sort", "~sort", "=sort", "!sort")
fmt = ("%2s %7s" + " %6s"*len(cases))
print fmt % (("i", "2**i") + cases)
for i in r:
@@ -92,6 +93,13 @@ def tabulate(r):
doit(L) # \sort
doit(L) # /sort
+ # Do 3 random exchanges.
+ for dummy in range(3):
+ i1 = random.randrange(n)
+ i2 = random.randrange(n)
+ L[i1], L[i2] = L[i2], L[i1]
+ doit(L) # 3sort
+
# Arrange for lots of duplicates.
if n > 4:
del L[4:]
--
cgit v0.12