correct time complexity for 1200

fishercoder1534 · fishercoder1534 · commit 5436659c8a57 · 2019-11-23T06:43:16.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_1200.java b/src/main/java/com/fishercoder/solutions/_1200.java
@@ -34,7 +34,7 @@
 public class _1200 {
     public static class Solution1 {
         /**
-         * Time: O(n)
+         * Time: O(nlogn) due to sorting
          * Space: O(k) where k is the distinct number of differences between two numbers in the given array
          * */
         public List<List<Integer>> minimumAbsDifference(int[] arr) {
