Showing posts from April, 2022
GROWTH FUNCTIONS Those functions that derive the running time of the algorithm and memory space requirements for the given set of inputs are known as Algorithm Complexity. ASYMPTOMATIC NOTATIONS Asymptotic notations are the mathematical notations us…
DATA STRUCTURE Data Structure can be defined as the way of organizing and storing the data on the computer memory so that it can be used efficiently. The data structure is about rendering data elements in terms of some relationship, for better organ…
GRAPHS A graph G can be defined as an ordered set G (V, E) where V (G) represents the finite and non- an empty set of vertices and E(G) represents the set of edges that are used to connect these vertices. The graph is a non-linear data structure. I…
Tree A tree is a nonlinear data structure in which items are arranged in a sorted Sequence, It is used to represent hierarchical relationships existing among several data items. Each node of a tree may or may not point to more than one node. It is a …
RECURSION The process in which a function calls itself directly or indirectly is called Recursion and the corresponding function is called a Recursive function. Recursion Recursion is used to solve problems involving iterations in reverse order. It s…
LINKED LIST A linked list is a collection of elements called ‘nodes’ where each node consists of two parts: Info: Actual element to be stored in the list. It is called a data field. Next: one or more link that points to the next and previous node in…
