What is K and how we have decided the it should be K(n) in bubble sort and K in the binary search ?
Time Complexity
hi vanshika,
K is some constant which donates the time taken by machine to do backend operations,it is to be ignored.
Only thing that matters is n.
It is K(n/2),K(n/4),K(n/8)… in case of binary search ,thats how it came out to O(logN).
Sir forgot to write it down.
Please let me know if there is any other doubt.