critticall

heh...

That algorithm needed a little help, I had to figure out the initialization values for i & j (and l clearly doesn''y matter).

template<class RI>
void jitter_sort(RI begin, RI end)
	{
	int n = (int)(end-begin); --n;
   
	int o=0, p=1, k=1, i=0, j=1, l;
	while(k>=i)
		{
		k=-1;
		while(n>k)
			{
			k++; l=(&*begin)[k];
			if(j>l)
				{
				(&*begin)[i]=l; i++; (&*begin)[k]=j;
				}
			if(l>j)
				{
				i=k; j=(&*begin)[k];
				}
			}
		j=0; n=i-p;
		}
	}

Sort from the site critticall.com for several unique records, works only for numbers greater or equal to zero. What shouldn''t be a problem since an addition and a subtraction to all members of the array, is not hard to perform.

Generally, all variables used in c-critticall language are by default int type set to 0. So, variable j should be set to zero if we want to sort numbers of values from 0 to n.

0+ nevone

quote:

---

Original post by Anonymous Poster
We need to create games that will fit postsingularity era.

---

i''m doing my best

Hope so.

Critticall is a program that helps you to improve engines for that kind of games.


o+nevone

quote:

---

Original post by nevone
Sort from the site critticall.com for several unique records, works only for numbers greater or equal to zero. What shouldn''t be a problem since an addition and a subtraction to all members of the array, is not hard to perform.

Generally, all variables used in c-critticall language are by default int type set to 0. So, variable j should be set to zero if we want to sort numbers of values from 0 to n.

0+ nevone

---

IIRC, it creates an infinite loop if j is initialized to 0.