One of the most important areas you should have a focus on when you are preparing for the interview for position of python developer, is a pattern printing program using python. I don’t think that in an interview if your recruiter is recruiting you as a software developer/software engineering profile will not ask to write … Read more
An AVL tree is a self-balancing binary search tree. It was named AVL on its inventor Adelson-Velsky and Landis. There are some scenarios in the Binary search tree where complexity can go O(n) in the worst-case search. so to get search in O(log n) in worst case AVL tree is designed. Property of AVL tree … Read more
Radix sort is a non-comparative sorting algorithm that sorts elements digit by digit starting from least significant digit to most significant digit. Suppose if you want to sort 10 elements in ascending order using radix sort, first sort the digit of unit place. After that sort the tenth place digit. This process will go till … Read more
Quick Sort is a very popular sorting algorithm also known as partition exchange sort. Quick sort follows divide-and-conquer strategy to sort an array elements. In this algorithm first we select the pivot element. This pivot element can be selected either the left most element or right most element. After selecting pivot element, first divide an … Read more
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