The second section of the course concentrates on a range of data structures commonly used within software development environments. You will be introduced to both linear and circular array data structures, single and double linked list data structures, binary tree data structures and hash table data structures.
This section also looks at some of the common algorithms used with data structures to add, remove and sort items within a data structure as well as how to search for data.
The searching algorithms covered will include linear, binary and hash table searching techniques to illustrate how the efficiency of searches can be dependent on the underlying data structure.
The sorting algorithms will cover an appropriate range (eg contrasting bubble and selection sorts with the merge and quick sorts) to illustrate how the time efficiency can be improved at the expense of increased space or complexity.
You will be introduced to the concept of recursive algorithms to enable you to understand their advantages and disadvantages as compared to iterative algorithms.
Next: Linked Lists