CLUE - Self Study Modules

Functions & Arrays / Handy Arrays Library

Handy Arrays Lib - Basics
File Links: a01.pdf a01.mp4
Introduction to our "Handy Arrays Library", aka HAL, & implementation of the essential functions it requires.

Handy Arrays Lib - Sorting
File Links: a02.pdf a02-1-design.mp4 a02-2-coding.mp4 a02-3-testing.mp4 a02-debug.pdf
This series of videos will guide you through implementing sorting features in HAL. The last PDF, "a02-debug.mp4" won't provide you with a step-by-step video solution. It is meant as a separate exercise to tackle only when you are done with the other steps. The intent is here to offer you a bug to track down.

Handy Arrays Lib - Searching
File Links: a03.pdf a03-1-is-sorted.mp4 a03-2-design.mp4 a03-3-coding.mp4
We are going to first implement a function allowing us to assess whether an array is sorted, then use it to make sure we search only on already sorted arrays. The search itself will use the binary search approach also known as dichotomic search.

Handy Arrays Lib - Comparing
File Links: a04.pdf a04-1-by-position.mp4 a04-2-by-contents.mp4 a04-3-fixing-dichotomic-search.mp4
Last addition to HAL; we are now going to write two functions able to compare two HAL arrays. The first one will compare them by position, the second by contents i.e. making sure the same data is in two arrays even if it is there in a different order.