Inversion count of an array
Given an array, find the total number of inversions of it. If (i < j) and (A[i] > A[j]), then pair (i, j) is called an inversion of an array A. We need to count all such pairs in the array.
Tag: Recursive
Hybrid QuickSort Algorithm
A Hybrid Algorithm is an algorithm that combines two or more other algorithms that solve the same problem. In this article, a hybrid of the Quicksort with Insertion Sort is discussed to achieve better performance.
Quicksort Algorithm – C++, Java, and Python Implementation
Quicksort is an efficient in-place sorting algorithm, which usually performs about two to three times faster than merge sort and heapsort when implemented well. Quicksort is a comparison sort, meaning that it can sort items of any type for which a less-than relation is defined.
Merge Sort Algorithm – C++, Java, and Python Implementation
Merge sort is an efficient sorting algorithm that produces a stable sort, which means that if two elements have the same value, they hold the same relative position in the sorted sequence as they did in the input.
Bubble Sort Algorithm – Iterative & Recursive | C, Java, Python
Bubble sort is a stable, in-place sorting algorithm named for smaller or larger elements “bubble” to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even compared to insertion sort, and is not recommended for large input.
Selection Sort Algorithm – Iterative & Recursive | C, Java, Python
Selection sort is an unstable, in-place sorting algorithm known for its simplicity. It has performance advantages over more complicated algorithms in certain situations, particularly where the auxiliary memory is limited.
Insertion Sort Algorithm – Iterative & Recursive | C, Java, Python
Insertion sort is a stable, in-place sorting algorithm that builds the final sorted array one item at a time. It is not the very best in terms of performance but more efficient traditionally than most other simple O(n^2) algorithms such as selection sort or bubble sort.
Print all k–colorable configurations of a graph (Vertex coloring of a graph)
Given a graph, find if it is k–colorable or not and print all possible configurations of assignment of colors to its vertices.
Print all Hamiltonian paths present in a graph
Given an undirected graph, print all Hamiltonian paths present in it. The Hamiltonian path in an undirected or directed graph is a path that visits each vertex exactly once.
Find the total number of unique paths in a maze from source to destination
Find the total number of unique paths that the robot can take in a given maze to reach a given destination from a given source.
Find the path from source to destination in a matrix that satisfies given constraints
Given an N × N matrix of positive integers, find a path from the first cell of the matrix to its last cell.
Find the longest possible route in a matrix
Given a rectangular path in the form of a binary matrix, find the length of the longest possible route from source to destination by moving to only non-zero adjacent positions.