Bubble sort is a simple sorting method to sorts the array elements. In the bubble sorting technique each array element is compared to the adjacent elements of the array. If the lower index value is greater than the highest index position of the array then swap these two adjacent values to maintain ascending sorting order. … Read more
Insertion Sort is one of the simplest sorting algorithms that compare each array element with new elements that we want to insert in an array. It will insert a new element when found the correct position because the array should maintain order. Let’s understand it in brief Suppose you have an array of 5 cards … Read more
Selection Sort is a simple comparison-based sorting algorithm. It divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the … Read more
Linear probing is a simple way to deal with collisions in a hash table. A collision happens when two items should go in the same spot. Imagine a parking lot where each car has a specific spot. If a car finds its spot taken, it moves down the line to find the next open one. … Read more
In hashing technique, Collison is a situation when hash value of two key become similar. Suppose we want to add a new Record with key k in a hashtable, but index address H(k) is already occupied by another record. This situation is known as a collision. Example to understand the Collision Situation In the below … Read more
Hashing is an approach to convert a larger key into a smaller integer value within a given limited range. Here the key is a larger value that we need to store And the integer value is an address in the hash table where the key will be store. To find integer address from key-value we … Read more
There are Six operation which we can perform on Binary search Tree. Binary search tree operations Search Searches an element in a tree. Insert Inserts an element in a tree. Pre order Traversal Traverse a tree in a pre-order manner means first to traverse the Root node, then the Left node, and at last Right … Read more
A binary search tree is one of the variants of the binary tree, also known as an ordered binary tree, in which the nodes are arranged in order by some rule mentioned below. Node of binary search tree follows order mentioned below The value of all nodes in the left sub-tree or left child should … Read more
Binary search is a very efficient searching technique for finding an element from a sorted Array. This technique follows the divide and conquers approach to perform a searching operation. Suppose we have 10,000 sorted elements in an array and want to search a value in that array. If we follow linear searching, then in the … Read more
A linear search or sequential search is a searching method to check a desired element or data in a given Array in computer science. In linear searching technique, each element of an Array is compared with the value for which we perform the search operation. If matches are found, it will return the array index … Read more