Too much project work?? (1 Viewer)

[edcox]

Hi there,

We've been doing a fair bit on our ajor projects lately, i.e. Data flows, IPO's, Data dictionaries, and part A (Documentation) is due after half yearlies.

But

Today the teacher decided to do something different and make us write linear search and binary search algorithms. nobody had a clue. apparantly all this will be on our half yearlies, but we've done shit all.

Should I be worried, or will it come in time. I think i will start learning from the Davis book, because it's good, but i mean, it would be nice to learn what was on the exam in class..

Oh, btw, funniest shit, about a week ago he told the whole class to summarise this chapter in the Davis book, and the response was pretty much get fucked.

Any advice'd be great

 

[Martyno1]

Linear and binary search algorithms are easy, if you really don't want to learn how they're done just memorise them and figure out how to apply them. They come up pretty much every year in the HSC so I'd advise learning them...

also, this link will be very helpful for all of your algorithms:
http://www.boredofstudies.org/other/1995_SDD_N_Methods_of_Algorithm_Description_BOS.pdf

 

[Deadly-Bagel]

Wow, we nailed those at the start of yr 11. Definitely something you should know by now.

A binary search is easy. As long as you know how the sort works, you should be able to figure out the code.

Binary search must have the array in order. Otherwise it won't work. Take the middle value of the array using min + max / 2 and compare it to the number to be searched. If the number to be searched (let's call it X) is greater than the number in the middle of the array (let's call it mid), min now becomes mid and mid becomes min + max / 2. Keep doing this until Mid = X.

A linear search is easy. The array doesn't even have to be sorted. Have a count variable, call it i, i = 0 (or 1, depending on where the array starts), compare X to array, if they're not the same, then i = i + 1 and compare again.

This is quite easily obtained information, I know. My point is that I don't have these memorised. I know that binary means two. Divide the array into two until you get your answer. Linear means straight. Search the array in a straight line until you come to your answer. Not hard to figure out the code from there.


You should also learn the three main sorts too. Insertion, Bubble, and selection sort. You might need to know one to get your binary search working =P