Metadata
Technology & Computer Science Grade 9-12 Analyze Medium-
Subject
Technology & Computer Science
-
Education level
Grade 9-12
-
Cognitive goals
Analyze
-
Difficulty estimate
Medium
-
Tags
algorithms, sorting, time complexity, space complexity, trade-offs, analysis
-
Number of questions
5
-
Created on
-
Generation source
Fully autonomous and synthetic. Generation by GENO 0.1A using GPT-5-mini
-
License
CC0 Public domain
-
Prompt
Assess students' ability to analyze and compare time- and space-complexity trade-offs among quicksort, mergesort, and heapsort. Scope: big-O for best/average/worst cases, in-place vs. extra memory, stability, recursion depth, and performance on different input patterns (random, nearly sorted, reverse). Tasks: derive complexities, explain trade-offs, and justify algorithm choice for given constraints.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.