PHP Code:
main( )
{
new array[ 10 ], tick;
for( new i; i < 10; i ++ ) {
array[ i ] = random( 10000 ) - random( 2000 );
}
tick = GetTickCount();
for(new i = 0; i < 50000; i ++) {
sortArray(array);
}
printf("sortArray: %dms", GetTickCount() - tick);
tick = GetTickCount();
for(new i = 0; i < 50000; i ++) {
SortValuesInArray(array);
}
printf("SortValuesInArray: %dms", GetTickCount() - tick);
return true;
}
stock SortValuesInArray(array[], size_of = sizeof(array))
{
new temp;
for(new i = 1, j = 0; i < size_of; i ++)
{
for(j = i; j != 0; j --)
{
if(array[j] < array[j - 1])
{
temp = array[j];
array[j] = array[j - 1];
array[j - 1] = temp;
}
}
}
return 1;
}
sortArray( arr[ ], len = sizeof arr ) {
new tmpVar1, tmpVar2, i;
while(i < len) {
for( new j = len - 1; j > -1; j --) {
if( arr[ j ] < arr[ i ] ) {
tmpVar1 = arr[ i ];
arr[ i ] = arr[ j ];
arr[ j ] = tmpVar1;
}
}
i++;
}
for( i = 0; i < len; i ++ ) {
if( i == 0 ) {
tmpVar1 = arr[ i ];
}
tmpVar2 = arr[ i + 1 ];
arr[ i + 1 ] = tmpVar1;
tmpVar1 = tmpVar2;
if( i == (len - 1) ) {
arr[ 0 ] = arr[ len ];
}
}
return true;
}
Code:
sortArray: 1822ms
SortValuesInArray: 641ms
it compiles and executes fine. Yours is faster anyways. I guess I should get rid of that second loop in mine.
Edit:
I got rid of the loop, but it still performs pretty much the same, like a very small difference, any idea why?
PHP Code:
sortArray( arr[ ], len = sizeof arr ) {
new tVar, i;
while(i <= len) {
for( new j = len ; j > -1; j --) {
if( arr[ j ] < arr[ i ] ) {
tVar = arr[ i ];
arr[ i ] = arr[ j ];
arr[ j ] = tVar;
}
}
i++;
}
return true;
}
Code:
-183,0,756,1748,2740,5751,5980,6320,6493,7657
sortArray: 1957ms
SortValuesInArray: 637ms
I guess I've just hijacked someone else's thread.
Edit again:
Okay I guess now it's optimized, but still slower than SickAttack's one.
PHP Code:
sortArray( arr[ ], len = sizeof arr ) {
new tVar;
for( new i; i <= len; i++ ) {
for( new j = ( len - 1 ) ; j > ( i - 1 ); j --) {
if( arr[ j ] < arr[ i ] ) {
tVar = arr[ i ];
arr[ i ] = arr[ j ];
arr[ j ] = tVar;
}
}
}
return true;
}
Code:
before sorting: 9,12,14,19,7,17,15,0,17,19
after sorting: 0,7,9,12,14,15,17,17,19,19
sortArray: 854ms
SortValuesInArray: 641ms
