6. Max Min unsorted array Iterate through the array, doing a linear search takes O(n) and keep a min pointer and max pointer, both being updated as needed Time complexity --> O(n) Space complexity --> O(1)