by admin | Oct 11, 2020 | Data Structure

A graph is a non-primitive and non-linear data structure. It is a group of (V, E) where V is a set of vertexes, and E is a set of edge. In the graph, a vertex is connected with another vertex, and the connection between two vertexes is called edge. Edge acts as a...
by admin | Oct 11, 2020 | Data Structure

The stack is a non-primitive and linear data structure. It works on the principle of LIFO (Last In First Out). That is, the element that is added to the end is removed first, and the element that is added first is removed at the end. There is only one end to insert...
by admin | Oct 11, 2020 | Data Structure

by admin | Oct 11, 2020 | Data Structure

by admin | Oct 11, 2020 | Data Structure

by admin | Oct 11, 2020 | Data Structure

Insertion sort is a simple sorting technique. It is best suited for small data sets, but it does not suitable for large data sets. In this technique, we pick an element and insert it in its appropriate place. Insertion sort is not a fast sorting algorithm because it...
by admin | Oct 11, 2020 | Data Structure

by admin | Oct 5, 2020 | Data Structure

Collision Resolution Techniques Collision in hashing In this, the hash function is used to compute the index of the array.The hash value is used to store the key in the hash table, as an index.The hash function can return the same hash value for two or more keys.When...
by admin | Oct 5, 2020 | Data Structure

Hashing: Hashing is a process in which a large amount of data is mapped to a small table with the help of hashing function. It is a searching technique. Hash table We can understand the hash table better based on the following points: In a data structure, the hash...
by admin | Oct 5, 2020 | Data Structure

Binary Search: When there is a large data structure, the linear search takes a lot of time to search the element. The binary search was developed to overcome the lack of a linear search. It is based on the divide & conquers principle. It is a very fast searching...