For Quick Sort ... what if .. we check for both of the sides in the while loop of partition function?

Currently for a Quick Sort, we are only checking if element in left pointer (iterative index value, i) is smaller than pivot and if it is, we increment that index, else we check for element at right index to be bigger than pivot…

But wouldn’t it be faster if we check for both conditions, i.e. instead of if…elif… we use if…if… ??

I tried that and seemingly it works fine…maybe, haven’t tried whole test cases…

[update], It’s not working, lol