Metadata
Technology & Computer Science Undergraduate Analyze Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Undergraduate

  • Cognitive goals

    Analyze

  • Difficulty estimate

    Medium

  • Tags

    sorting algorithms, algorithm analysis, time complexity, space complexity, 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, heapsort, and insertion sort across input distributions (random, sorted, reverse, partially sorted, many duplicates), input sizes, and memory constraints; evaluate time (best/avg/worst), space and stability, consider implementation details (pivot choice, recursion/stack, external sorting), and justify algorithm selection using analytical and empirical evidence.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.