Partition An Array
easy
1. You are given an array(arr) of integers and a pivot. 2. You have to re-arrange the given array in such a way that all elements smaller or equal to pivot lie on the left side of pivot and all elements greater than pivot lie on its right side. 3. You have to achieve this in linear time. Note -> For more information, watch question video.
Constraints
1 <= N <= 100000 -10^9 <= arr[i] <= 10^9 -10^9 <= pivot <= 10^9
Format
Input
An Integer n arr1 arr2.. n integers An integer pivot
Output
Check the sample output and question video.
Example
Sample Input
5
7
-2
4
1
3
3
Sample Output
Swapping -2 and 7
Swapping 1 and 7
Swapping 3 and 4
-2 1 3 7 4
Question Video