github-starred/ultimatepp
2
0
Fork 0
mirror of https://github.com/ultimatepp/ultimatepp.git synced 2026-09-01 15:52:41 -06:00
Code Issues 33 Projects Packages Wiki Activity Actions

Merge continued

Browse source 
git-svn-id: svn://ultimatepp.org/upp/trunk@10263 f0d560ea-af0d-0410-9eb7-867de7ffcac7
This commit is contained in:
cxl 2016-10-04 08:34:39 +00:00
parent adf46bd64e
commit 2e4b276e07
3860 changed files with 1161787 additions and 438 deletions
Download patch file Download diff file Expand all files Collapse all files

49
uppdev/MergeSort/MergeSort.cpp Normal file
View file

@ -0,0 +1,49 @@
#include <Core/Core.h>
void Reorder(const Vector<int>& order, Vector<int>& data)
{
LOG("----------------------");
ASSERT(data.GetCount() == order.GetCount());
Vector<int> reorder, ndx;
reorder.SetCount(order.GetCount());
ndx.SetCount(order.GetCount());
for(int q = reorder.GetCount(); --q >= 0;)
reorder[q] = q;
for(int i = 0; i < order.GetCount(); i++) {
int pi = reorder[order[i]];
DUMP(order[i]);
DUMP(pi);
Swap(data[i], data[pi]);
reorder[ ndx[i] ] = pi;
DUMPC(reorder);
DUMPC(data);
LOG("------------");
}
}
struct VectorLess {
bool operator()(const Vector<int>& a, const Vector<int>& b) const
{
return a[0] < b[0];
}
};
bool int_less(int a, int b)
{
return a < b;
}
bool vector_less(const Vector<int>& a, const Vector<int>& b)
{
return a[0] < b[0];
}
CONSOLE_APP_MAIN
{
Vector< Vector<int> > x;
for(int i = 0; i < 20; i++) {
x.Add().Add() = rand();
}
Sort(x, &vector_less);
DUMPCC(x);
}