@fxm - in case you're interested, my development framework #define def #define type state_size as ulongint def seq_return as ulong def seq_state as state_size type MiniBits ' n-bit literal declare constructor( seq_state = 0, as ubyte = 0) declare constructor( as MiniBits) declare operator let( seq_s...

maybe i found something that matches all my criteria. with a multiply = 5, i got 'unusual' @256GB a *= mul e += f xor a shr _shr a xor= e f += a i'm thinking any odd multiplier between 7 and 2^(bits\2 - 3) will work update: nope. hiccups. .. relying on perception otherwise is not exactly scientific....

Isn't animated about data coming in?

I'm still searching for an algorithm that's

pract-friendly
6 operations or less
high period
not fussy

Could treat all LF colon and comma as the same char?

If not, well ima go for a walk anyway

@fxm - animated histo - love that. I have a histo but its nowhere near as cool

@MrSwiss - I haven't yet thought of a project. UByte simply demonstrates the period :D

type mylit as ubyte '' visually inspect period. change to higher as needed function CSG_HP(byref a as mylit) as mylit ' high period "random number generator" - 2019 Oct 1 - by dafhi ' period is roughly better than: 2^(bits*3 - 2) /' usage scenarios: low-power diagnostic equipment 8K+ path...

holy cow!

this does well in my monte carlo sim

new version

' sort timer - 2017 Dec 4 - by dafhi '' shorthand, for later #define d #define '' sort this Type vector3d As double x,y,z as uinteger color End Type ' ------------------------------------- Type my_SORT_TYPE as vector3d ' ------------------------------------- '' comment out the .z for plain var type...

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