it accepts. as array is address of the first element i.e. in your case
address of a[0] and there is no upper bound check atleast in C.
so you can access and assign memory location which is not reserved in
your decleration but don't follow this practice as you may write or
corrupt memory used by ot
hi everyone ,
what i propose for this very problem , if i understand it correctly , is to use recursion with memoization ...
let us assume that we want to know the number of paths in a directed graph between 2 of its vertices u and v ...
what we do is write this simple memoization :
# define num
