Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 959 Bytes

Sorting_README.md

File metadata and controls

6 lines (5 loc) · 959 Bytes

Sorting

Sl No Qu title Platform Soln Lang Time comp Space comp difficulty approach
1 Sorting Parts Codeforces C++ O(n^2) O(1) Easy
  1. Check If array sorted then-"NO"; else:"YES"
2 Advantage Codeforces C++ O(n * log(n)) O(1) Medium
  • finds differences of elements with the largest element while handling duplicates.
  • Use set to get unique elements