Index

Selection Sort

the array is stored in the consecutive order in the momory. The insertion is expensive as the items before the insertion should moved over. With the liked list, it can be anywhere so insertion is easy. However, if wanting to the last item in the linked list, it’s difficult as you don’t the item before the last. So it’s great when you want to read all items at once. For deletion, linked-list still better.

https://learning-oreilly-com.ezproxy.christchurchcitylibraries.com/library/view/grokking-algorithms-second/9781633438538/OEBPS/Text/02.html#heading_id_10