So I'm using this method to find the min and max value of an array simultaneously where I split the array into n/2 and n/2 parts. I then keep splitting each part until I have either a pair of numbers or a single number.What I'm trying to do now is the same thing but I'm trying to come up with a method that will always use 3n/22 comparisons. The method above doesn't use 3n/22 comparisons each time. So I just want to visualize how this is done on an array before I start to programming the method. 
How do I find the max and min value of an array in 3n/22 comparisons?
algorithms;search algorithms;arrays;comparison