“从我做起振兴中华”问题的算法复杂度是n还是n²

#include<stdio.h>
int count=0;
void road(int row,int col,int arr[][5])
{
if(arr[row][col]==7)//从0开始跳到7则为一条完整路线
{
count++;
}
if(col+1<5&&arr[row][col+1]==arr[row][col]+1)//横向走
{
road(row,col+1,arr);
}
if(row+1<4&&arr[row+1][col]==arr[row][col]+1)//纵向走
{
road(row+1,col,arr);
}
}
int main()
{
int arr[4][5]={
{0,1,2,3,4},
{1,2,3,4,5},
{2,3,4,5,6},
{3,4,5,6,7}};
road(0,0,arr);
printf("%d",count);
return 0;
}