Difference between Array and LinkedList

An array is a collection of identical data objects or similar type of data objects stored in consecutive memory locations under a common heading or a variable name.
While a linked list is a data structure which contains a sequence of the elements where each element is linked to its next element. There are two fields in an element of a linked list. One is Data filed, and other is link filed, Data field contains the actual value to be stored and processed. Furthermore, the link field contains the address of the next data item in the linked list.

In an array, elements are stored in a consecutive manner in memory.
In a linked list, elements can be stored at any available place as the address of a node is stored in the previous node.

Insertion & deletion takes more time in an array as elements are stored in consecutive memory locations.
Insertion & deletion are fast & easy in a linked list as only value of a pointer is needed to change.

Array can be single dimensional, two dimension or multidimensional.
A linked list can be singly, doubly or circular linked list.

Comments

Difference between abstract class and interface in OOP

Source: Amit Sethi In Interface: > All variables must be public static final. > No constructors. An interface can not be instantiated using the new operator. > All methods must be public abstract .

DFS Performance Measurement

Completeness DFS is not complete, to convince yourself consider that our search start expanding the left subtree of the root for so long path (maybe infinite) when different choice near the root could lead to a solution, now suppose that the left subtree of the root has no solution, and it is unbounded, then the search will continue going deep infinitely, in this case , we say that DFS is not complete. Optimality Consider the scenario that there is more than one goal node, and our search decided to first expand the left subtree of the root where there is a solution at a very deep level of this left subtree , in the same time the right subtree of the root has a solution near the root, here comes the non-optimality of DFS that it is not guaranteed that the first goal to find is the optimal one, so we conclude that DFS is not optimal. Time Complexity Consider a state space that is identical to that of BFS, with branching factor b, and we start the search from th

Soumik's Tech Blog

Search This Blog