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.
Category: Divide & Conquer
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.
Iterative Implementation of Quicksort
Write an iterative version of the recursive Quicksort algorithm.
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.
Binary Search in C++ STL and Java Collections
This post will discuss how to search for a given target value in a sorted array of integers using binary search implementation provided by the C++ standard library (STL) and Java Collection framework.
Find the square of a number without using the multiplication and division operator
Given an integer, find its square without using multiplication and division operator. Also, the use of the power function from any programming language library is not allowed.