Programming in Python $-$ Practice Problem #$2$

In this practice problem, you should be trying to familiarize yourself with the ability to sort in order to solve.

Given an integer array, your program should return true if any value appears at least twice in the array and should return false if every element is distinct. Your function will take a list of numbers as input and return true$/$false if duplicate elements exist in the array. Your algorithm should have the time complexity of $O(nlogn).$ Do NOT use Python's set collection.

Example $1$:

Input: nums $=[1,2,3,4]$

Output: False

Example $2$:

Input: nums $=[1,2,3,1]$

Output: True