Singly and doubly linked lists (also known simply as Linked Lists) hold collection of elements, which preserve their order. Their representation in the memory is dynamic, pointer-based. They are linked sequences of elements. Adding is a fast operation, but it is a bit slower than adding to a List, because every time when we add an element to a linked list, we allocate a new memory area.… Read more
Archive for April, 2018
Linked List
Tuesday, April 24th, 2018Array List
Monday, April 23rd, 2018ArrayList is a dynamic array. What that means is that an ArrayList can have any amount of objects and of any type. This data structure was originally designed to simplify the processes of adding new elements into an array. Under the hood, an ArrayList is an array whose size is doubled every time it runs out of space.… Read more
Arrays
Friday, April 20th, 2018Data Structures
Friday, April 20th, 2018A data structure is a collection of data of same type, grouped together by some criteria (usually, the type of data). In fact, we have already learned about one type of data structure, the array. But, aside of the array, there are other kinds of data structures, each with its own behavior, advantages and disadvantages.… Read more