mirror of
https://github.com/ultimatepp/ultimatepp.git
synced 2026-05-21 06:45:39 -06:00
.benchmarks
git-svn-id: svn://ultimatepp.org/upp/trunk@11488 f0d560ea-af0d-0410-9eb7-867de7ffcac7
This commit is contained in:
parent
c4a92e38c3
commit
f736a227a6
1 changed files with 19 additions and 3 deletions
|
|
@ -2,7 +2,11 @@
|
||||||
|
|
||||||
using namespace Upp;
|
using namespace Upp;
|
||||||
|
|
||||||
|
#ifdef _DEBUG
|
||||||
|
const int N = 1000;
|
||||||
|
#else
|
||||||
const int N = 1000000;
|
const int N = 1000000;
|
||||||
|
#endif
|
||||||
|
|
||||||
// M. D. MCILROY
|
// M. D. MCILROY
|
||||||
// Appendix. An adversary for
|
// Appendix. An adversary for
|
||||||
|
|
@ -53,16 +57,28 @@ int antiqsort(int n, int *a)
|
||||||
CONSOLE_APP_MAIN
|
CONSOLE_APP_MAIN
|
||||||
{
|
{
|
||||||
StdLogSetup(LOG_COUT|LOG_FILE);
|
StdLogSetup(LOG_COUT|LOG_FILE);
|
||||||
for(int n = -1; n <= 10; n++) {
|
// -3 Sorted
|
||||||
|
// -2 Valley pattern
|
||||||
|
// -1 Reverse sorted
|
||||||
|
// 0 Max Random values
|
||||||
|
// >0 - number of random values
|
||||||
|
for(int n = -3; n <= 10; n++) {
|
||||||
Vector<String> h;
|
Vector<String> h;
|
||||||
for(int i = 0; i < N; i++)
|
for(int i = 0; i < N; i++)
|
||||||
if(n < 0)
|
if(n == -3)
|
||||||
h.Add(AsString(N - i));
|
h.Add(Format("%06d", i));
|
||||||
|
else
|
||||||
|
if(n == -2)
|
||||||
|
h.Add(Format("%06d", 2 * abs(N / 2 - i) + (i > N / 2)));
|
||||||
|
else
|
||||||
|
if(n == -1)
|
||||||
|
h.Add(Format("%06d", N - i));
|
||||||
else
|
else
|
||||||
if(n)
|
if(n)
|
||||||
h.Add(AsString(Random(n)));
|
h.Add(AsString(Random(n)));
|
||||||
else
|
else
|
||||||
h.Add(AsString(Random()));
|
h.Add(AsString(Random()));
|
||||||
|
DUMP(h);
|
||||||
TimeStop tm;
|
TimeStop tm;
|
||||||
Sort(h);
|
Sort(h);
|
||||||
double t = tm.Seconds();
|
double t = tm.Seconds();
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue