Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
list.cpp		list.cpp
ll.c		ll.c
ll.cpp		ll.cpp
palindrome.c		palindrome.c
quicksort_ll.cpp		quicksort_ll.cpp
singlell.cpp		singlell.cpp

README.md

Linked List

array vs Linkedinlist

Arrays

fixed size of allocated memeory and thus the upperlimit has to be known
insertion is array is expensive as all elements need to be shifted one place to create room . Same for deletion

On contrary Linked list

dynamic size and ease of inseryion/ deletion
but only sequential ( no dynamic) access
extra memeory for pointer to next element
not cache firendly without any contihious memeory or locality of refenrce