Algorithms for data structures
Data structures not only define how data is organized and stored, but also the operations performed on the data structure. While common operations include inserting, removing, and searching for data, the algorithms to implement those operations are typically specific to each data structure. Ex: Appending an item to a linked list requires a different algorithm than appending an item to an array.
inserting, removing, searching for data 같은 경우에는 common operation을 포함하는 반면에 그러한 operation을 implement하는 알고리즘은 각각의 data structure마다 다르다.
linked-list의 경우, 아예 리스트가 비어 있으면 head와 tail 모두 newNode에 연결
그렇지 않으면, tail node의 next pointer를 newNode에 그리고 list의 tail pointer도 newNode에
array와 linked list에서 동일하게 적용할 수 있는건 오로지 current size반환할 때
코드를 봐서 알 수 있듯이 array->length 혹은 list->length를 하면 된다.
Algorithms using data structures
Some algorithms utilize data structures to store and organize data during the algorithm execution. Ex: An algorithm that determines a list of the top five salespersons, may use an array to store salespersons sorted by their total sales.
