02 Program development 2

* NOTE: This unit may be considered on-going as concepts and skills are used all throughout year 1 and 2.

Describe the characteristics of standard algorithms on linear arrays. These are: sequential search, binary search, bubble sort, selection sort.

Discuss an algorithm to solve a specific problem. Students should be expected to discuss the differences between algorithms, including both standard and novel algorithms. For example, discussing the advantages and disadvantages of using a binary search as opposed to a sequential search.

Deduce the efficiency of an algorithm in the context of its use. tudents should understand and explain the difference in efficiency between a single loop, nested loops, a loop that ends when a condition is met or questions of similar complexity. Students should also be able to suggest changes in an algorithm that would improve efficiency, for example, using a flag to stop a search immediately when an item is found, rather than continuing the search through the entire list.