The Altera Centauri collection has been brought up to date by Darsnan. It comprises every decent scenario he's been able to find anywhere on the web, going back over 20 years.
25 themes/skins/styles are now available to members. Check the select drop-down at the bottom-left of each page.
Call To Power 2 Cradle 3+ mod in progress: https://apolyton.net/forum/other-games/call-to-power-2/ctp2-creation/9437883-making-cradle-3-fully-compatible-with-the-apolyton-edition
“As a lifelong member of the Columbia Business School community, I adhere to the principles of truth, integrity, and respect. I will not lie, cheat, steal, or tolerate those who do.”
"Capitalism ho!"
A list of values that are linked to each other by pointers. Basically you start with the head, which includes a value and then the address of the next node. You can only get from one end to the other by following all of the "links" (addresses). This is in contrast to an ordinary list where you can just access any node at random.
If there is no sound in space, how come you can hear the lasers?
){ :|:& };:
“As a lifelong member of the Columbia Business School community, I adhere to the principles of truth, integrity, and respect. I will not lie, cheat, steal, or tolerate those who do.”
"Capitalism ho!"
A list of values that are linked to each other by pointers. Basically you start with the head, which includes a value and then the address of the next node. You can only get from one end to the other by following all of the "links" (addresses). This is in contrast to an ordinary list where you can just access any node at random.
Uh oh, better edit this with an admission that you cross-posted.
Why would you run a binary search on a linked list? It will have the same asymptotic worst case as a regular full scan of the linked list, and I don't think that the linear coefficients or the lower order terms would make any valuable difference.
The algorithm is easy to write, just plainly pointless.
Why would you run a binary search on a linked list? It will have the same asymptotic worst case as a regular full scan of the linked list, and I don't think that the linear coefficients or the lower order terms would make any valuable difference.
The algorithm is easy to write, just plainly pointless.
Correct. As for why anyone would do this, ask my professor, I have no idea. I think he was trying to demonstrate the disadvantages of linked lists/binary search, but the idea of running binary search on a linked list is just nonsense.
This whole class is kind of depressing. It's the most advanced CS class available to freshmen, but I did all this stuff in my junior year of high school. Oh well. I get an easy semester.
If there is no sound in space, how come you can hear the lasers?
){ :|:& };:
It' viable if your comparison check is VERY expensive and your list has been sorted beforehand. This still means that the man who decided to use a list was either retarded or an Indian.
Graffiti in a public toilet
Do not require skill or wit
Among the **** we all are poets
Among the poets we are ****.
It' viable if your comparison check is VERY expensive and your list has been sorted beforehand. This still means that the man who decided to use a list was either retarded or an Indian.
Yes, that was an observation I made, but when would these two things simultaneously be true?
If there is no sound in space, how come you can hear the lasers?
){ :|:& };:
Comment