Maximum number of partitions that can be sorted individually to make sorted
Last Updated :
16 Feb, 2023
Given an array arr[] of size n such that elements of arr[] in range [0, 1, ..n-1] where every number is present at most once. Our task is to divide the array into maximum number of partitions that can be sorted individually, then concatenated to make the whole array sorted.
Examples :
Input : arr[] = [2, 1, 0, 3]
Output : 2
If divide arr[] into two partitions
{2, 1, 0} and {3}, sort them and concatenate
then, we get the whole array sorted.
Input : arr[] = [2, 1, 0, 3, 4, 5]
Output : 4
The maximum number of partitions are four, we
get these partitions as {2, 1, 0}, {3}, {4}
and {5}
Input : arr[] = [0, 1, 2, 3, 4, 5]
Output : 6
The maximum number of partitions are six, we
get these partitions as {0}, {1}, {2}, {3}, {4}
and {5}
Approach:
The given code finds the maximum number of partitions that can be made from an array of integers. The code defines a function "maxPartitions" that takes an array and its length as input. The function then uses a loop to iterate through each element of the array and find the maximum element in the prefix ending at the current index. If the maximum element is equal to the current index, the function increments the count of partitions as a new partition can be made ending at that index. Finally, the function returns the count of partitions. The main function initializes an array with values and calls the "maxPartitions" function with the array and its length as inputs. The result of the function is then printed to the console.
Algorithm to find maximum partitions:
- Initialize a variable "ans" to store the count of partitions and a variable "max_so_far" to store the maximum element in the prefix of the array.
- Loop through each element in the array.
a. Set "max_so_far" to the maximum of "max_so_far" and the current element.
b. If "max_so_far" is equal to the current index, increment the value of "ans" by 1. - Return the value of "ans" as the result.
The idea is based on the fact that if an element at i is maximum of prefix arr[0..i], then we can make a partition ending with i.
C++
// CPP program to find Maximum number of partitions such
// that we can get a sorted array.
#include <bits/stdc++.h>
using namespace std;
// Function to find maximum partitions.
int maxPartitions(int arr[], int n)
{
int ans = 0, max_so_far = 0;
for (int i = 0; i < n; ++i) {
// Find maximum in prefix arr[0..i]
max_so_far = max(max_so_far, arr[i]);
// If maximum so far is equal to index, we can make
// a new partition ending at index i.
if (max_so_far == i)
ans++;
}
return ans;
}
// Driver code
int main()
{
int arr[] = { 1, 0, 2, 3, 4 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << maxPartitions(arr, n);
return 0;
}
// This code is contributed by Aditya Kumar (adityakumar129)
// C program to find Maximum number of partitions such that
// we can get a sorted array.
#include <stdio.h>
// Find maximum between two numbers.
int max(int num1, int num2)
{
return (num1 > num2) ? num1 : num2;
}
// Function to find maximum partitions.
int maxPartitions(int arr[], int n)
{
int ans = 0, max_so_far = 0;
for (int i = 0; i < n; ++i) {
// Find maximum in prefix arr[0..i]
max_so_far = max(max_so_far, arr[i]);
// If maximum so far is equal to index, we can make
// a new partition ending at index i.
if (max_so_far == i)
ans++;
}
return ans;
}
// Driver code
int main()
{
int arr[] = { 1, 0, 2, 3, 4 };
int n = sizeof(arr) / sizeof(arr[0]);
printf("%d", maxPartitions(arr, n));
return 0;
}
// This code is contributed by Aditya Kumar (adityakumar129)
// java program to find Maximum number of partitions such
// that we can get a sorted array
import java.io.*;
class GFG {
// Function to find maximum partitions.
static int maxPartitions(int arr[], int n)
{
int ans = 0, max_so_far = 0;
for (int i = 0; i < n; ++i) {
// Find maximum in prefix arr[0..i]
max_so_far = Math.max(max_so_far, arr[i]);
// If maximum so far is equal to index, we can
// make a new partition ending at index i.
if (max_so_far == i)
ans++;
}
return ans;
}
// Driver code
public static void main(String[] args)
{
int arr[] = { 1, 0, 2, 3, 4 };
int n = arr.length;
System.out.println(maxPartitions(arr, n));
}
}
// This code is contributed by Aditya Kumar (adityakumar129)
# Python3 program to find Maximum
# number of partitions such that
# we can get a sorted array.
# Function to find maximum partitions.
def maxPartitions(arr, n):
ans = 0; max_so_far = 0
for i in range(0, n):
# Find maximum in prefix arr[0..i]
max_so_far = max(max_so_far, arr[i])
# If maximum so far is equal to
# index, we can make a new partition
# ending at index i.
if (max_so_far == i):
ans += 1
return ans
# Driver code
arr = [1, 0, 2, 3, 4]
n = len(arr)
print(maxPartitions(arr, n))
# This code is contributed by Smitha Dinesh Semwal.
// C# program to find Maximum number of partitions
// such that we can get a sorted array
using System;
class GFG
{
// Function to find maximum partitions.
static int maxPartitions(int []arr, int n)
{
int ans = 0, max_so_far = 0;
for (int i = 0; i < n; ++i)
{
// Find maximum in prefix arr[0..i]
max_so_far = Math.Max(max_so_far, arr[i]);
// If maximum so far is equal to index,
// we can make a new partition ending at
// index i.
if (max_so_far == i)
ans++;
}
return ans;
}
// Driver code
public static void Main ()
{
int []arr = { 1, 0, 2, 3, 4 };
int n = arr.Length;
Console.Write (maxPartitions(arr, n));
}
}
// This code is contributed by nitin mittal.
<?php
// PHP program to find Maximum
// number of partitions such
// that we can get a sorted array.
// Function to find maximum partitions.
function maxPartitions($arr, $n)
{
$ans = 0;
$max_so_far = 0;
for ($i = 0; $i < $n; ++$i) {
// Find maximum in prefix arr[0..i]
$max_so_far = max($max_so_far, $arr[$i]);
// If maximum so far is equal to index,
// we can make a new partition ending at
// index i.
if ($max_so_far == $i)
$ans++;
}
return $ans;
}
// Driver code
{
$arr = array(1, 0, 2, 3, 4);
$n = sizeof($arr) / sizeof($arr[0]);
echo maxPartitions($arr, $n);
return 0;
}
// This code is contributed by nitin mittal
?>
<script>
// Javascript program to find Maximum number of partitions
// such that we can get a sorted array.
// Function to find maximum partitions.
function maxPartitions(arr, n)
{
let ans = 0, max_so_far = 0;
for (let i = 0; i < n; ++i) {
// Find maximum in prefix arr[0..i]
max_so_far = Math.max(max_so_far, arr[i]);
// If maximum so far is equal to index,
// we can make a new partition ending at
// index i.
if (max_so_far == i)
ans++;
}
return ans;
}
let arr = [ 1, 0, 2, 3, 4 ];
let n = arr.length;
document.write(maxPartitions(arr, n));
// This code is contributed by divyesh072019.
</script>
Time Complexity: O(N)
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem