References
[1]. Deitel, H & Deitel, P. (2007). C++ How to Program. Prentice Hall.
[2]. Insertion Sort. (n.d). In Wikipedia. Retrieved from https://en.wikipedia.org/wiki/Insertion_sort
[3]. Linked List. (n.d). In Wikipedia. Retrieved from https://github.com/trekhleb/javascript-algorithms/tree/ master/src/data-structures/linked-list
[4]. Pandey, R. C. (2008). Comparison of Various Sorting Algorithms. Computer Science and Engineering.
[5]. Sareen, P. (2013). Comparison of sorting algorithms (on the basis of average case). International Journal of Advanced Research in Computer Science and Software Engineering, 3(3), 522-532.
[6]. Seymour Lipschutz, (n.d). In wikipedia. Retrieved from https://en.wikipedia.org/wiki/Seymour_Lipschutz
[7]. Sipser, M. (2006). Introduction to the Theory of Computational. Boston: Thomson Course Technology, 2.
[8].What is a linked list and how it works? What are advantages and disadvantages of linked lists? (2016). Dev. Interview. Retrieved from http://developerinterview. com/p/algorithms/what-is-a-linked-list-and-how-it-workswhat- are-advantages-and-disadvantages-of-linkedlists- 39