-
The Only Reason Sinclair Succeeded (Provoking Controversy)Although I love my Sinclairs dearly, I think that the only reason they succeeded was because at the time most people did not know any better (factori…
... insisted on using the same algorithm as was used in the ... -
MP3 loading testsIn a previous thread, Spector says: "The loss of an mp3 file is nothing compared to the loss from an old audio cassette tape. " Dunny says: "Which i…
... with CoolEdit's Spectrum Analysis algorithm to cause it to give ... -
MP3 loading testsIn a previous thread, Spector says: "The loss of an mp3 file is nothing compared to the loss from an old audio cassette tape. " Dunny says: "Which i…
... with CoolEdit's Spectrum Analysis algorithm to cause it to give ... -
Sinclair Basic Vs PascalWith the rise of the structured programming movement (Jackson et al) was it wise to put the Basic programming language into the Spectrum. By this ti…
... wouldn't know what an algorithm was if it jumped up ... -
Sinclair Basic Vs PascalWith the rise of the structured programming movement (Jackson et al) was it wise to put the Basic programming language into the Spectrum. By this ti…
... degree). The first year was algorithm-centric together with teaching data ... -
Sinclair Basic Vs PascalWith the rise of the structured programming movement (Jackson et al) was it wise to put the Basic programming language into the Spectrum. By this ti…
... a mix)
influenced by algorithm choices and data structure
Sinclair Basic Vs PascalWith the rise of the structured programming movement (Jackson et al) was it wise to put the Basic programming language into the Spectrum. By this ti…
... 't even know what an algorithm is.
You don't ... cases.
It's the algorithm that is important. The more ...Sinclair Basic Vs PascalWith the rise of the structured programming movement (Jackson et al) was it wise to put the Basic programming language into the Spectrum. By this ti…
... 't get much practice with algorithm development (Java and STL for ...Oh so BRIGHT!What is the SLOWEST way to change the attribute area to BRIGHT? It has to be legit! No meaningless instructions or doing stuff for the sake of it. …
... to use a Monte Carlo algorithm.
[code]
10 LET ...Recursive functionsA while ago Phil demonstrated a nice example of recursiveness in a DEF FN function. Sadly it doesn't appear to be online anymore and I have difficult…
... done using recursion: a recursive algorithm can always be changed into ...Recursive functionsA while ago Phil demonstrated a nice example of recursiveness in a DEF FN function. Sadly it doesn't appear to be online anymore and I have difficult…
... done using recursion: a recursive algorithm can always be changed into ... />
Try a non-recursive algorithm for the Towers of Hanoi!Recursive functionsA while ago Phil demonstrated a nice example of recursiveness in a DEF FN function. Sadly it doesn't appear to be online anymore and I have difficult…
... BEEP]Try a non-recursive algorithm for the Towers of Hanoi ...Help understanding some z80 asmI'm trying to work out how to represent the structure of a "sprite" in the SAM as "Grabbed" by SmallC. I can see the assembler implementation but I …
... .asm?view=markup"]heapsort[/URL] algorithm that uses a user-supplied ...Help understanding some z80 asmI'm trying to work out how to represent the structure of a "sprite" in the SAM as "Grabbed" by SmallC. I can see the assembler implementation but I …
... using a differential screen update algorithm -- ie it only redraws portions ...Who knows how to program a "pathfinder"?Hi all. I like to play games like "Colour Lines" and I think, I will create a version of this game for the SAM Coupe. It looks easy - until this "dam…
... ]?
The A* search algorithm is pretty common and helps ... check out is Warshall's algorithm. It works with successive matrix ...Who knows how to program a "pathfinder"?Hi all. I like to play games like "Colour Lines" and I think, I will create a version of this game for the SAM Coupe. It looks easy - until this "dam…
Thanx to you all for your suggests. The best solution seems the A* search algorithm for me, as it is that way for the problem I was looking for. Alc Ano: Your ADTHeapAdd shows me also a basic approach how to start :-)
Wo of WomoteamWho knows how to program a "pathfinder"?Hi all. I like to play games like "Colour Lines" and I think, I will create a version of this game for the SAM Coupe. It looks easy - until this "dam…
... /> 10 REM pathfinder with Dykstra algorithm
20 DIM a$(9 ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... where an O(n^2) algorithm was taking up all the ... world, when an O(n) algorithm was all that was needed ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... where an O(n^2) algorithm was taking up all the ... world, when an O(n) algorithm was all that was needed ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... it.
Writing an algorithm that is O(n2) is ... point where the O(n) algorithm will win out. Being able ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... =hldswrth;169983]
Writing an algorithm that is O(n2) is ... point where the O(n) algorithm will win out.
An O(n^2) algorithm that understands this can walk ... a more naive O(n) algorithm that leads to faults more ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... />
An O(n^2) algorithm that understands this can walk ... a more naive O(n) algorithm that leads to faults more ... surely even a O(n) algorithm which page faults all the ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... surely even a O(n) algorithm which page faults all the ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... It state that for an algorithm whose number of instructions is ... of N for which that algorithm will require less instructions ... than an algorithm whose number of instructions is ... - if the O(n) algorithm requires 10000n bytes of storage ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... state that for an algorithm whose number of instructions is ... N for which that algorithm will require less instructions ... than an algorithm whose number of instructions ... />
By contrast an algorithm that accesses memory arbitrarily is ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... 's say you have an algorithm which is O(n), but ... say that you have an algorithm which is O(n^2 ... to me that the first algorithm is still a better option ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... on the implementation of the algorithm (you have stated lots of ... operation, and the O(n) algorithm with still eventually win out ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... operation in my O(n) algorithm resulted in transferring disk-to ... /> If my O(n^2) algorithm managed to stay entirely in ... that equation, and see which algorithm takes less instructions.
algorithm is faster, and any good ...Death of the Computer Science DepartmentRead this article on the death of the computer science department in universities by Neil McBride from De Montfort. It makes very interesting (and wo…
... your severely faulting O(n) algorithm ends up as I=2e7N ...
