qsort and stuff
Here is the quicksort. Its dynamic so that it takes array of int,dint,real(tested) byte and char (untested, dunno where to use char tough). if you find any bugs, please inform. Also suggestions on how to improve would be nice.
I first wrote recursive quicksort in c++, then removed the recursion. That way i could first concentrate on partition logic, then on how to use stack to remove recursion and on when to push to stack and pop from stack. Also to be honest, debugging with Visual Studio is much easier. Overloading is very nice too. Hope Siemens will really work on improving the scl editor and debugging features.
I improved usage interface compared to my selection sort to take array and one element from array (as adviced by ld) to get array lenght and element datawidth. Function itself could be improved atleast by sorting small partitions with insertion sort or similar.
Next on the filter. I think I'll look first on simulating analog butterworth filter (need to find out how it is made and component values calculated) so I can better relate the digital version.
Peter if you have code for the filter in C i will gladly accept it, i believe it would help a Lot.
If I feel like
, I might do Peters sequencer first added with JesperMPs good ideas.
On pandianis predictor, I dont yet know what variable is doing what
. Need to look at it later.
Thank you.