I have noticed it when we do ( (l + h) // 2 ) to find the mid term in binary search it gives us an integer value but instead we could use int( (l+ h) / 2) and it improves overall speed of program.
Is this true of was it just coincidence

when i used (l + h) // 2 my program was only 10% faster but when i did int( ( l+h ) / 2) it became 75% faster.