why the constant time “k” which is of breaking the problem in smaller in binary search is not dependent on “n” or “n/2”
in any circumstances unlike bubble sort?
Doubt in computing time complexity
hello @we_kaash
here in time complexity analysis we use k to represent constant ,
k will never be dependent on any variable .