i am not able to figure out in the recurrance reln for bubble sort time taken to break into smaller problem was Kn and in case of binary search it is k how is sir figuring this out???
Time complexity using recurrence
Kn because, u need to compare it with each element to find the largest element so n comparisons are each done in O(1) and hence n times is O(n)
in binary search u simply find the middle in one step and apply ur required condition in one step as well so it is O(1) or indepent of n which is some value ''k"
for deeper understanding, u can refer to this playlist