An in-place algorithm is an algorithm which transforms input using no auxiliary data structure. However a small amount of extra storage space is allowed for auxiliary variables. The input is usually overwritten by the output as the algorithm executes. In-place algorithm updates input sequence only through replacement or swapping of [...]
To search an element in a given array, it can be done in two ways Linear search and Binary search. Linear Search Given an array arr[] of n elements, to search for a given element follow below steps :- Start from the leftmost element of arr[] and one by one [...]
Assume, that both arrays are sorted in ascending order and we want resulting array to maintain the same order. Algorithm to merge two arrays A[0..m-1] and B[0..n-1] into an array C[0..m+n-1] is as following: Introduce read-indices i, j to traverse arrays A and B, accordingly. Introduce write-index k to store [...]
Sorting is a process of arranging items in ascending or descending order. This process can be implemented via many different algorithms. Following is the list of sorting algorithms : Bubble Sort Selection Sort Count Sort Insertion Sort Merge Sort Quicksort Heap Sort Time complexity of sorting algorithm [...]
Floyd's algorithm for cycle detection is the fastest method to detect loop in linked list. Traverse linked list using two pointers. Move one pointer by one and other pointer by two. If these pointers meet at some node then there is a loop. If pointers do not meet then linked [...]
Space complexity is a measure of the amount of working storage an algorithm needs. That means how much memory, in the worst case, is needed at any point in the algorithm. As with time complexity, we're mostly concerned with how the space needs grow, in big-Oh terms, as the size [...]