Hi, I have been "reading" algorithms and know some c++ as well. But, I can't implement algorithms even after getting a correct solution. It seems very difficult to even implement n*n grid solutions and graph algorithms(even if I know the correct algorithm) What to do to improve "implementation" skills?

i have 2 arrays a[n],b[n].(think of them as coordinates) i sort a. now i want to know to which a[i], b[i] corresponds to NOW AFTER a IS SORTED! (BETTER THAN THE 0(N^2)ALGORITHM) is there any way?