Algorithm A1 finds the min max without div and conquer means that binary search is not used. So, it is linear search. Time complexity is O(n).
Algorithm A2 scans the entire array linearly. So, this is also performing a linear search in time O(n).
Hence, A1=A2.( with respect to time.)