Finding pairs of numbers within A that add up to N
If you had a sorted array of n numbers, then finding pairs that sum to N should take O(n) time.

Sorting should take O(n log n) time.

O(n log n + n) is O(n log n).  That's better than O(n2).  Therefore, you would be better off sorting the array first.