Recent Comments
Category Archives: Algorithms
For Loop – worst case performance – Big O notation – o(n)
Recently I came across one of many Big O notations ,O(N), which means “that for large enough input sizes the running time increases linearly with the size of the input – wikipedia”. In other words if i want to search … Continue reading
Life around technology 