... 0-60 time of a car" would be a suitable context. The data in the list has to have a numeric amount of>=0. Data can be stored inside computers as a linear list. If an item has to be added, then the item of data in the middle of the list, then all the data after the item needs to be inserted after the item to make way for the new item of data. Algorithms could be developed to do this, however in reality they would not be used, and would prove to be not efficient if large amounts of data were involved. The pointer system is the preffered system to be used, which shows how newer data structures enable the user to insert and delete items of data without having to move any existing data. However this is not the most efficient way of dealing with large amounts of ...

See this essay or coursework document in full right now