The complexity tells how fast the running time of algorithm increases with increase in size of input. We call the input size N.
In this case, N is the size of array. The first loop is O(N) and the second loop is O(N/5), however constants in time complexity do not contribute to the growth of running time, so we consider only the highest power of the varying term, N in our case and we drop the constant term 5. Thus both loops are O(N).