jj2007 wrote:..QSort() is a stable mergesort ..

:O

i've actually been working on an in-place merge for about a week. seems my brain wants me to solve this one.

cool stuff dodicat. u know i love quicksort. u can static j in sortup() pretend both J & I static if j >begin ' destroyed I J not a concern, first explicit recursion if i <finish ' destroyed I J a concern, but only 'i' and 'finish' used @ this line [edit:] one might be able to do same w 'BEGIN.'...

update: speed-tested. this sort is slow enjoy! /' outlier sort concept by dafhi - 2019 July 22 - description - array: 2 1 0 index 0 "tension" = 2 index 1 "tension" = 0 index 2 "tension" = -2 additional array "index()" of experimental size between 2 and len(arr...

@Tourist Trap .. DPI: error loading shcore.dll

FXG861: engaging! music sets a great atmosphere

could always postpone. i mean .. another compo with possibility of more interested parties .. couldn't hurt

@paul doe

dafhi wrote:.. The pure math of SVG has my head spinning.

actually, the simple act of concentration gets my head spinning.

i'm fine; just need to work through some financial and head-space issues

@paul

I was wondering how you were going to pull off something like an SVG renderer. The pure math of SVG has my head spinning. Cairo would definitely make things a lot easier

fxm wrote:The most important is not the final result obtained, but rather all the paths taken to get there.

upvote

tip: the unit you control does not (seem to) fire

Lachie, could you put links to everything in the first post?

next on my practice list :-)

unit list idea. most-used at front

possible formula
access count in last 30 sec / (unit_time - unit_time_previous)

- load time

+ music
+ overhead parallax
+ RTS

can't wait to learn the game :)

404 on game by Pitto

fyi

thank you UEZ. you are a talented programmer.