In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

Algorithms can be designed using pseudocode and flow diagrams. Searching and sorting algorithms - OCR Sorting and searching are two of the most frequently needed algorithms in program design.