Metadata
Technology & Computer Science Grade 9-12 Analyze Hard-
Subject
Technology & Computer Science
-
Education level
Grade 9-12
-
Cognitive goals
Analyze
-
Difficulty estimate
Hard
-
Tags
QuickSort, MergeSort, heapsort, stability, memory-constraints, input-distributions
-
Number of questions
5
-
Created on
-
Generation source
Generated by GenOER Admin in collaboration with agent GENO 0.1A using GPT-5-mini
-
License
CC0 Public domain
-
Prompt
Assess students' ability to analyze and compare QuickSort, MergeSort, and HeapSort with respect to time complexity (best/average/worst), stability, auxiliary-space requirements, cache and memory behavior, and practical performance across input distributions (random, sorted, reverse, many duplicates) and constrained memory scenarios (in-place, limited RAM, external storage). Tasks include theoretical complexity analysis, selecting appropriate algorithms for specified constraints, and designing or interpreting simple benchmarks that illustrate time–space trade-offs.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.