The worst case for Quicksort happens when each partitioning divides an array of size n into sub arrays of size 1 and n-1. In your case, is that possible? Why isn’t it possible? What is the worst outcome of partitioning if the pivot is the median of 2k numbers? So what is the worst case in your algorithm?