A month ago , I had learnt breadth first search ( abbreviated as BFS ) is a simple algorithm for traversing a graph from my teacher (Phạm Nguyễn Sơn Tùng) who teaching at Big-O Coding .What is the BFS algorithm ?
I learnt insertion sort, I think the most important part of it is:
A[i+1] = A[i]
This is used to move node, e.g. array node. And the stop condition is:
i<0 || a[i] <= key