Re: [ql-users] Quicksort

Laurence Reeves writes: IIRC the resulting sort is "stable" allowing for an unambiguous fast binary search (also included) of the array(s) using the same criteria as for the sort. (That was at least my programming goal. I'll have to check this, though.) >>>

Re: [ql-users] Quicksort

P Witte wrote: > Laurence Reeves writes: > > >> P Witte wrote: >> >>> IIRC the resulting sort is "stable" allowing for an unambiguous fast >>> binary >>> search (also included) of the array(s) using the same criteria as for the >>> sort. (That was at least my programming goal. I'll have to

Re: [ql-users] Quicksort

Laurence Reeves writes: >P Witte wrote: >> IIRC the resulting sort is "stable" allowing for an unambiguous fast >> binary >> search (also included) of the array(s) using the same criteria as for the >> sort. (That was at least my programming goal. I'll have to check this, >> though.) >> > Sorry?

Re: [ql-users] Quicksort

P Witte wrote: > IIRC the resulting sort is "stable" allowing for an unambiguous fast binary > search (also included) of the array(s) using the same criteria as for the > sort. (That was at least my programming goal. I'll have to check this, > though.) > Sorry? I don't think I follow your banter

Re: [ql-users] Quicksort

Dilwyn Jones writes: > Many of you will be familiar with the Quicksort recursive sorting > routine. I wanted to sort large amounts of data at one stage and > compiled a program containing a recursive routine, which quickly ran > out of stack space for all the recursion it needed. Im just in the p

Re: [ql-users] Quicksort

Very quick response... you have the normal HUGE bug. When you split the array into a left and right chunk, you MUST stack the LARGER chunk, and sort the smaller one. That's why the stack space disappears. And... be very careful about what happens when you can have duplicate values... what happe

[ql-users] Quicksort

Trying to prevent my brain shrinking even smaller than its present size while sat here 'home alone' (i.e. feeling cerebrally challenged at the moment, make of that what you will), here's a little something to challenge the ql-users grey matter. Many of you will be familiar with the Quicksort re

Re: [ql-users] Bug?

On 17 Jan 2007, at 19:19, Marcel Kilgus wrote: > > There were bugs in the past of QPC that vanished when using a debugger > (the instructions used by the debugger did by pure chance clear some > internal register a normal code execution did not). But that was over > 10 years ago, nowadays the QPC

Re: [ql-users] What is Ornak ?

Subject: Re: [ql-users] What is Ornak ? > Dilwyn it is on your collection of QL Adventures on your download > website > > Rich > Thanks. As Tony said, spelling is different and there's so much on my site even I sometimes find something on the site I don't remember putting there until I check t

Re: [ql-users] Sharing Aurora with PC screen/keyboard/mouse

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Neil Riley wrote: > > Tony, Have been informed that my Aurora uses a 5 pin Din socket for > the keyboard which I've just > ordered a PS2 to DIN convertor. also ordered a PS2 to Serial convertor > for the mouse. > > Aurora has SuperHermes. Exactly.

Re: [ql-users] Sharing Aurora with PC screen/keyboard/mouse

>> Aurora does not have a 'keyboard connector'. It has to use third party >>hardware, like superHermes, Diren etc that plug into the 8049 slot. A >>standard AT to PS2 adapter works with superHermes, so I guess that would >>work with the KVM switch. However sH and Di-ren use a round socket with

Re: [ql-users] Bug?

Hi Marcel I'm using 3.33. The problem now is that I can't reproduce the behavior. At the time clearing the data register before loading it with a word from memory solved the problem. However removing the moveq #0,dn does not bring back the problem. The compare operation also had an offset i.e.