convert this pseudocode into actual code c++

create empty dynamic array (henceforth referred to as A) mark cell [0,0] as visited insert cell [0,0] at the end of A while A is not empty remove last element from A (henceforth referred to as current) current's neighbors not visited yet (henceforth referred to as neighbors) if neighbors is not empty insert current at the end of pick a random neighbor from neighbors (henceforth referred to as neigh) remove the wall between current and neigh mark neigh as visited insert neigh at the end of A endir endwhile create empty dynamic array (henceforth referred to as A) mark cell [0,0] as visited insert cell [0,0] at the end of A while A is not empty remove last element from A (henceforth referred to as current) current's neighbors not visited yet (henceforth referred to as neighbors) if neighbors is not empty insert current at the end of pick a random neighbor from neighbors (henceforth referred to as neigh) remove the wall between current and neigh mark neigh as visited insert neigh at the end of A endir endwhile