Similar comparisons made by various sorting algorithms

Question

I would like a sample input (a sequence of integers), such that Bubble Sort, Quick Sort, Tree Sort and Heap Sort perform the same first N-1 comparisons (not necessarily in t