Introduction - If you have any usage issues, please Google them yourself
Prepared with the following function prototype recursive and non-recursive function of two equ, is responsible for judging the array a and b elements of the former n value corresponds to the same standard press, is the return to true, otherwise return false. And the preparation of the main function to call them to verify its correctness. bool equ (int a [], int b [], int n) Tip: recursive function as follows to decomposition and to address the problem, first determine the last element of the same, different then return false is the same whether or not to see n equal to 1, is the return to true, otherwise, to carry out recursive calls (Chuan to real parameter a, b and n-1, to judge the former n-1 elements of the same sex), and return the results of recursive calls (with the previous n-1 elements of the same whether or not the same).