Why my python version hoare partition quick sort is slower than lomuto partition?

Question

Normally when implementing quick sort, Hoare\'s scheme is more efficient than Lomuto\'s partition scheme because of fewer swaps on average. To verify this, I try to count the sw