【Memoirs】 Week#6 Oct 17th

Tutorial

Practised the codes we learned and prepare for the quiz, we could get our test back in today's lecture.

Lecture

I had been announced that the test paper would be returned at the end of the lecture.
Today we kept studying in algorithms questions.

There is NO potentially an algorithm to solve every problem

If there are two or meow algorithms solving the same problem, we compare the efficiency to decide which algorithm to use.

How do we discover new algorithms?
A: By heuristics + tips, but they do not guarntee you can find a new algorithm.

Before electronnic, programmable computers, Alonzo Church and Alan Turing showed there were many unsolvable algorithms, also showed class of solvable algorithms.













Before Canada-411, we used to look up phone numbers in white pages. There are (at least) two different, correct ways to find the leaf ( 2-sided sheet) with the business you're looking for ( conclude it;s not there).

Linear search -----------> order of thousand steps

Binary search -----------> order 8 steps

Clearly there's no fool-proof method, but there's some techniques that often make progress. It helps to write down the whole process:

> Understand the problem
> Devise ( one or moew) plan (s)
> Try the plan
> Look back

Wikipedia Project Part II was due on Oct 19th, Part II spent much more time than part I, we had to write a specfic plan to help to improve and edit the topics we selected.