Sort it

Problem description. You’re given an array ar and a number p. Partition the array, so that all elements greater than p are to its right, and all elements smaller than p are to its left. p is called the pivot of the partition. Guideline - in this problem, you do not need to move around the numbers ‘in-place’. This means you can create two lists and combine them at the end. Input Input descripti