Metadata
Technology & Computer Science Any Level Understand Medium-
Subject
Technology & Computer Science
-
Education level
Any Level
-
Cognitive goals
Understand
-
Difficulty estimate
Medium
-
Tags
sorting, algorithms, time complexity, space complexity, stability
-
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
Evaluate students' ability to compare bubble, insertion, merge, quick, and heap sorts by analyzing best/average/worst-case time complexity, space requirements, stability, and in-place behavior; include short explanations of typical use cases, adaptive behavior, and the impact of pivot choice and data characteristics.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.