Data structures tutorial: the array based unsorted list. скачать в хорошем качестве

Data structures tutorial: the array based unsorted list.

In this video, we go through the logic of an implementation of an array-based unsorted list. Examples and analysis are provided for the following algorithms: insert -- adds a value to the list remove -- removes a value get -- retrieves a value for the list find -- performs a linear search on the list These four algorithms make up our logical interface for the list. The main advantage of this data structure is it's impressive overall speed. The insert, remove, and get algorithms all occur in constant time (O(1)). Only the find operation is relatively slow, processing in linear time ( O(n) ) because of it's dependence on the linear search algorithm.