Re: VB6 LISTBOX problem

Tech Tip: Click here to run a free scan for Windows Errors and optimize PC performance

I'm in the same place, so you're not alone. All but the simplest recursion seems to be something my mind just refuses to hold on
to, even if I study it long enough to figure out how it works in the first place.


Rob

"Mike Williams" <mike@xxxxxxxxxxxxxxxxx> wrote in message news:%23Ew8L7AFIHA.3360@xxxxxxxxxxxxxxxxxxxxxxx
"Steve Gerrard" <mynamehere@xxxxxxxxxxx> wrote in message news:j5adnTd-qY0TGYbanZ2dnUVZ_o2vnZ2d@xxxxxxxxxxxxxx

Funny, I get more confused by the Shell Sort than by the Quick Sort. :)

Yeah. It's weird, that. I can easily understand the basic principle of splitting an array into two parts with a single pass (in
order to approximately half the total sorting time that a "square of n" kind of sort would otherwise require) and to then repeat
that process with another single pass on each of the two halves (in order to half the total time again) and I can easily get it
into my head that if you repeat that process often enough you will eventually arrive at a point where each individual "section"
contains just one item . . . so that you don't actually need to perform a "sort" of the individual sections at all. I could sit
all day with a pack of hundreds of cards and I could effectively manually perform such a sort on them . . .but it's turning that
understanding into a real world algorithm that has me foxed, so I usually just copy somebody else's algorithm :-(

Mike


.

Relevant Pages

  • Re: VB6 LISTBOX problem
    ... approximately half the total sorting time that a "square of n" kind of sort ... would otherwise require) and to then repeat that process with another single ... "sort" of the individual sections at all. ... so I usually just copy somebody else's algorithm :-( ...
    (microsoft.public.vb.general.discussion)
  • Lock-free queue and the correctness of the algorithm....
    ... I have looked again at the following algorithm: ... JMP @@Exit ...
    (comp.programming.threads)
  • Re: a few questions about AES
    ... after that much it is pretty sure to repeat itself, ... losing security. ... assess the strength of my algorithm compared to AES. ... i'm having a really hard time pinning down the strength of the algorithm. ...
    (sci.crypt)
  • Re: Magic Algorithm for the Rubiks Cube?
    ... Is there an algorithm that would ... that is nevertheless guaranteed to reach the solved state no matter what ... repeat any of them. ...
    (rec.puzzles)
  • Re: a few questions about AES
    ... after that much it is pretty sure to repeat itself, ... i'm having a really hard time pinning down the strength of the algorithm. ... 512 character string has 4096 bits in it, but according to my calculations ... i am off the mark. ...
    (sci.crypt)