Based on your understanding of the algorithms discussed in class, formulate your own hypothesis for each algorithm under each scenario:

• Random arrays

• Already sorted arrays

• Reverse sorted arrays

• Arrays with many duplicate values

Rules:

• Must be written in your own words

• Must reference algorithm structure, not just Big-O

• Cannot quote or paraphrase the LLM input on stage 1

Example guidance you can give:

• Pivot selection

• Recursion depth

• Comparisons vs swaps

• Input sensitivity