Search results

Not wrong there. I'm fed up with Fowler's Shenanigans. I'm yet to see SamD's textbook, but Geoff Lancaster did a good job. Just make sure you check out another textbook. And I'm damn happy I don't need to know that flip-floppy thingo stuff. Knowing encapsulation and polymorphism is enough for me.

I was wondering that myself. Recently, I've been using something like: set Array(Index) to random to set a random variable. But I don't know if this is correct or whathaveyou. Maybe there needs to be something after it, like: set Array(Index) to random(1-100) Ah, I don't know.

I'm hoping this is a Ch10 thing.

Thanks very much everyone, especially Freedom_Dragon for providing those algos. I started doing an algorithm out of the Excel book, where you needed to generate 1000 random numbers, store them and sort them, and I thought that a bubble sort would be the least effective method, and thus...

As far as I know, we only need to know Linear and Binary Searches, and Insertion, Selection and Bubble Sorts. This doesn't seem like a huge amount to remember - are these the only searches and sorts we need to know (and indeed know an algorithm to describe the processes)?

Hmmm, that's funny, it did originally. Go to Lazarus' topic. Click on the link on the word HERE, and you should get to the Method of Algorithm Description PDF file.

Look at the algorithm description guide. The examples start off easy, so you can do them before you read the answers. If they bore you, you can do the extension algorithms at the very bottom (pp86-87). You can find it at http://boredofstudies.org/courses/techsci/sdd/SOFTSPEC.PDF Of course...