33:I[196793,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"Gingerbread"] 35:I[647935,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"RecordResourceResume"] 36:I[830476,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"FlashcardAccessBranch"] 37:I[315438,["/_next/static/chunks/1xyh1u_ku6jw-.js?dpl=nogit-1791882788","/_next/static/chunks/2_6olli-sutu3.js?dpl=nogit-1791882788","/_next/static/chunks/1qp4g--o6-1vf.js?dpl=nogit-1791882788","/_next/static/chunks/0psy-n5us57a4.js?dpl=nogit-1791882788","/_next/static/chunks/3mz725-y91ph6.js?dpl=nogit-1791882788","/_next/static/chunks/2x_dbpl3b_l2r.js?dpl=nogit-1791882788","/_next/static/chunks/0nojijad0occ8.js?dpl=nogit-1791882788","/_next/static/chunks/19ua1o9n5v3ho.js?dpl=nogit-1791882788","/_next/static/chunks/0zkcxwtbsqliz.js?dpl=nogit-1791882788","/_next/static/chunks/3yfg2hrj9oxbd.js?dpl=nogit-1791882788","/_next/static/chunks/35s1d7gs3nyqk.js?dpl=nogit-1791882788","/_next/static/chunks/38w1x0vrld4-w.js?dpl=nogit-1791882788","/_next/static/chunks/3jpl-42mbad5n.js?dpl=nogit-1791882788","/_next/static/chunks/3kzt2piec6aoa.js?dpl=nogit-1791882788","/_next/static/chunks/2lsi6eli88uwt.js?dpl=nogit-1791882788","/_next/static/chunks/2os7nxouq91eq.js?dpl=nogit-1791882788","/_next/static/chunks/3ml3vooxhiupb.js?dpl=nogit-1791882788","/_next/static/chunks/04zr-wqafvwoa.js?dpl=nogit-1791882788","/_next/static/chunks/36r9y5g_s4k64.js?dpl=nogit-1791882788","/_next/static/chunks/40lyu17d590zu.js?dpl=nogit-1791882788","/_next/static/chunks/2g-t2n9ahs3tn.js?dpl=nogit-1791882788","/_next/static/chunks/2mv9l1xl_aa4j.js?dpl=nogit-1791882788","/_next/static/chunks/44w2c3xxfw4wd.js?dpl=nogit-1791882788","/_next/static/chunks/16jtsbm2g52s0.js?dpl=nogit-1791882788","/_next/static/chunks/05mo4k9k-ry1n.js?dpl=nogit-1791882788","/_next/static/chunks/0v4byuex1x38h.js?dpl=nogit-1791882788","/_next/static/chunks/2eanemqjnv2vr.js?dpl=nogit-1791882788","/_next/static/chunks/2f3ohq_f1uov2.js?dpl=nogit-1791882788","/_next/static/chunks/0llqhg6-bxn_b.js?dpl=nogit-1791882788","/_next/static/chunks/2dx-vzwyw9a3g.js?dpl=nogit-1791882788","/_next/static/chunks/0qeo40bqomvxa.js?dpl=nogit-1791882788","/_next/static/chunks/1ku-vdy4ggo41.js?dpl=nogit-1791882788","/_next/static/chunks/1coblm1-go81_.js?dpl=nogit-1791882788","/_next/static/chunks/27ftpb6yvr6lz.js?dpl=nogit-1791882788","/_next/static/chunks/0k-y_4mcfub-p.js?dpl=nogit-1791882788","/_next/static/chunks/1o4x0l2qh0ta-.js?dpl=nogit-1791882788","/_next/static/chunks/3it1o0ex-l5qz.js?dpl=nogit-1791882788","/_next/static/chunks/2gqripb6ybmw9.js?dpl=nogit-1791882788","/_next/static/chunks/2l63yczi1z2qz.js?dpl=nogit-1791882788","/_next/static/chunks/075i0tnxt4not.js?dpl=nogit-1791882788","/_next/static/chunks/1eyu-5752jh17.js?dpl=nogit-1791882788","/_next/static/chunks/1of_-ow2iz1cj.js?dpl=nogit-1791882788","/_next/static/chunks/3ybwgs28on6c8.js?dpl=nogit-1791882788","/_next/static/chunks/13gj59kzq50t_.js?dpl=nogit-1791882788","/_next/static/chunks/1986062z5zb0v.js?dpl=nogit-1791882788","/_next/static/chunks/0uitbylhcd4am.js?dpl=nogit-1791882788","/_next/static/chunks/0wv8cpdr6cvhr.js?dpl=nogit-1791882788","/_next/static/chunks/06b61oz__qen3.js?dpl=nogit-1791882788","/_next/static/chunks/0a4x2f2g83l7b.js?dpl=nogit-1791882788","/_next/static/chunks/1lsxkfxy262n-.js?dpl=nogit-1791882788","/_next/static/chunks/3q5gc8lbwr4b4.js?dpl=nogit-1791882788","/_next/static/chunks/0dspbdeiizrn3.js?dpl=nogit-1791882788","/_next/static/chunks/2yss1g0cimuwe.js?dpl=nogit-1791882788","/_next/static/chunks/0e7v08pdxbxe2.js?dpl=nogit-1791882788","/_next/static/chunks/36nndwkz7iik3.js?dpl=nogit-1791882788","/_next/static/chunks/0zg1om_k0m5zv.js?dpl=nogit-1791882788","/_next/static/chunks/2fnth9-t6i7kd.js?dpl=nogit-1791882788","/_next/static/chunks/24srd-xd1m5z8.js?dpl=nogit-1791882788","/_next/static/chunks/0a57o9qvnv-nb.js?dpl=nogit-1791882788","/_next/static/chunks/41hx021qkamew.js?dpl=nogit-1791882788","/_next/static/chunks/1ksyn9m68446d.js?dpl=nogit-1791882788"],"TopicFlashcardRunner"] 24:[["$","$L33",null,{"feature":"flashcards"}],"$L34",["$","$L35",null,{"href":"/gcse/computer-science/aqa/sorting-algorithms/flashcards","label":"Sorting algorithms","subjectCode":"gcse_computer_science__aqa","surface":"flashcards"}],["$","$L36",null,{"runner":["$","div",null,{"className":"min-h-0 flex-1 overflow-hidden bg-background","children":["$","$L37",null,{"decks":[{"id":"2799299d-d866-450c-96e0-155c729cbfd7","title":"Sorting algorithms Flashcards","topicId":"515f5758-0686-5759-9e28-905fffdf0d67","topicSlug":"sorting-algorithms","cards":[{"id":"976f3223-b952-4e0c-97c6-6cc6e299aa6e","cardType":"cloze","points":null,"front":"A sorting algorithm rearranges items into a [ ], such as ascending or descending.","back":"A sorting algorithm rearranges items into a required order, such as ascending or descending.","mcqOptions":[{"text":"required order","correct":true,"explanation":"Sorting rearranges items according to a required order. That order may be ascending, descending, alphabetical or based on another specified field."},{"text":"random order","correct":false,"explanation":"Randomising items does not sort them because it creates no defined sequence. A sorting algorithm places items into the required order, such as ascending or descending."},{"text":"storage location","correct":false,"explanation":"A storage location identifies where data is held, not how items are arranged. Sorting places the items into a required order."},{"text":"required format","correct":false,"explanation":"Formatting changes how data is represented or displayed, rather than its sequence. A sorting algorithm rearranges items into a required order."}]},{"id":"45414b59-8dce-4f08-82c9-a322ff108784","cardType":"cloze","points":null,"front":"[ ] means smallest to largest; [ ] means largest to smallest.","back":"Ascending order means smallest to largest; descending order means largest to smallest.","mcqOptions":[{"text":"Ascending order means smallest to largest; descending order means largest to smallest.","correct":true,"explanation":"Ascending order increases from the smallest value to the largest. Descending order does the opposite, arranging values from largest to smallest."},{"text":"Descending order means smallest to largest; ascending order means largest to smallest.","correct":false,"explanation":"The two definitions have been reversed. Ascending order runs from smallest to largest, while descending order runs from largest to smallest."},{"text":"Ascending order means smallest to largest; random order means largest to smallest.","correct":false,"explanation":"Random order has no defined direction and does not mean largest to smallest. Descending order is the term for arranging values from largest to smallest."},{"text":"Random order means smallest to largest; descending order means largest to smallest.","correct":false,"explanation":"Random order does not arrange values from smallest to largest. That direction is ascending order, while descending order correctly runs from largest to smallest."}]},{"id":"8e9ec627-4038-486a-bcda-cd7f16fc4ccb","cardType":"basic","points":1,"front":"Give one reason sorting data is useful.","back":"It can make data easier to search.","mcqOptions":[{"text":"It can make data easier to search.","correct":true,"explanation":"Ordered data is easier to search because relevant values can be located systematically, and efficient methods such as binary search require the data to be sorted."},{"text":"It can make data easier to encrypt.","correct":false,"explanation":"Encryption protects data by encoding it and does not depend on sorting. Sorting is useful because an ordered collection can be easier to search."},{"text":"It can make data easier to compress.","correct":false,"explanation":"Compression reduces the storage needed for data and is not the main purpose of sorting. Sorting is useful because it can make data easier to search."},{"text":"It can make data easier to validate.","correct":false,"explanation":"Validation checks whether input follows specified rules, regardless of its order. Sorting is useful because arranging data can make it easier to search."}]},{"id":"d311dcd4-b48f-4ef3-b46d-f88f2c0e223e","cardType":"cloze","points":null,"front":"A [ ] checks two items; a [ ] exchanges their positions.","back":"A comparison checks two items; a swap exchanges their positions.","mcqOptions":[{"text":"A comparison checks two items; a swap exchanges their positions.","correct":true,"explanation":"A comparison examines two item values to determine their order. If their order is incorrect, a swap exchanges their positions."},{"text":"A swap checks two items; a comparison exchanges their positions.","correct":false,"explanation":"The two operations have been reversed. A comparison checks the values of two items, while a swap exchanges their positions in the list."},{"text":"A comparison checks two items; a pass exchanges their positions.","correct":false,"explanation":"A pass is a complete movement through the processed part of the list, not an exchange. A swap exchanges the positions of two items."},{"text":"A pass checks two items; a swap exchanges their positions.","correct":false,"explanation":"A pass covers a sequence of operations through part of the list rather than checking one pair. A comparison is what checks two items."}]},{"id":"17d99882-052b-4134-b2a0-de7e18691389","cardType":"cloze","points":null,"front":"A [ ] is one complete movement through the part of the list being processed.","back":"A pass is one complete movement through the part of the list being processed.","mcqOptions":[{"text":"pass","correct":true,"explanation":"A pass is one complete movement through the part of the list currently being processed, usually performing multiple comparisons and possible swaps."},{"text":"comparison","correct":false,"explanation":"A comparison checks the relative order of two items and is only one operation within the process. A complete movement through the processed section is a pass."},{"text":"iteration","correct":false,"explanation":"Iteration is a general repetition of instructions, not the sorting term for one complete movement through the list section. That movement is called a pass."},{"text":"swap","correct":false,"explanation":"A swap exchanges the positions of two items and can occur during a movement through the list. The complete movement itself is called a pass."}]},{"id":"463bb1ea-aea5-473c-ade9-591f4dc9c92d","cardType":"basic","points":1,"front":"When sorting ascending, compare 8 and 3. What should happen?","back":"Swap them to make 3 then 8.","mcqOptions":[{"text":"Swap them to make 3 then 8.","correct":true,"explanation":"In ascending order, the smaller value must appear first. Since 8 is greater than 3, swapping the pair produces the correct order, 3 then 8."},{"text":"Keep them as 8 then 3.","correct":false,"explanation":"Keeping 8 before 3 leaves the pair in descending order. For ascending order, the items must be swapped so that 3 comes before 8."},{"text":"Remove 8 to leave only 3.","correct":false,"explanation":"Sorting rearranges existing items rather than deleting values. Both numbers must remain, with 3 placed before 8 by swapping their positions."},{"text":"Swap them to make 8 then 3.","correct":false,"explanation":"A swap would change the positions to 3 then 8, not 8 then 3. Ascending order requires the smaller value, 3, to come first."}]},{"id":"f5cdab1e-4ebd-4440-aad6-3d7bdd68fdf5","cardType":"basic","points":1,"front":"In bubble sort, which items are compared?","back":"Adjacent items.","mcqOptions":[{"text":"Adjacent items.","correct":true,"explanation":"Bubble sort compares neighbouring, or adjacent, items. Incorrectly ordered pairs are swapped, causing larger or smaller values to move gradually through the list."},{"text":"First and last items.","correct":false,"explanation":"Bubble sort does not jump directly between the ends of the list. It repeatedly compares adjacent items and swaps them when they are in the wrong order."},{"text":"Randomly selected items.","correct":false,"explanation":"Bubble sort follows a systematic path rather than selecting items randomly. Each comparison is between adjacent items in the portion of the list being processed."},{"text":"All remaining items.","correct":false,"explanation":"Comparing one item with every remaining item describes a different sorting approach. Bubble sort compares only adjacent pairs as it moves through the list."}]},{"id":"f0cd5c08-6be0-42ac-b377-e0cb0e25c99c","cardType":"cloze","points":null,"front":"In ascending bubble sort, swap adjacent items when the [ ].","back":"In ascending bubble sort, swap adjacent items when the left item is greater than the right item.","mcqOptions":[{"text":"left item is greater than the right item","correct":true,"explanation":"Ascending order requires smaller values to appear first. If the left item is greater, swapping the adjacent pair moves the smaller value to the left."},{"text":"right item is greater than the left item","correct":false,"explanation":"That condition already places the smaller value on the left, so swapping would reverse a correctly ordered pair. Swap when the left item is greater than the right item."},{"text":"left item is less than the right item","correct":false,"explanation":"This describes a pair that is already correctly arranged in ascending order. A swap is needed when the left item is greater than the right item."},{"text":"left item is equal to the right item","correct":false,"explanation":"Equal adjacent values are already valid in ascending order, so exchanging them has no useful effect. Swap when the left item is greater than the right item."}]},{"id":"98c090fd-0dfa-4ed7-91ad-d335fbf6d581","cardType":"basic","points":1,"front":"After one full ascending bubble sort pass, what is guaranteed?","back":"The largest unsorted item is at the end.","mcqOptions":[{"text":"The largest unsorted item is at the end.","correct":true,"explanation":"Each adjacent swap moves a larger value to the right, so a complete ascending pass places the largest item in the unsorted section at its end."},{"text":"The largest unsorted item is at the beginning.","correct":false,"explanation":"This reverses the direction of movement. In an ascending bubble sort pass, larger items move right, so the largest unsorted item is guaranteed to reach the end."},{"text":"The smallest unsorted item is at the beginning.","correct":false,"explanation":"A left-to-right ascending pass does not guarantee that the smallest item reaches the beginning. It guarantees that the largest unsorted item reaches the end."},{"text":"The smallest unsorted item is at the end.","correct":false,"explanation":"This confuses ascending and descending sorting. In an ascending pass, the largest unsorted item moves to the end, rather than the smallest item doing so."}]},{"id":"f1625650-6c27-45b9-9d24-fdf6b969c366","cardType":"basic","points":2,"front":"Why is one bubble sort pass usually not enough?","back":"It only guarantees the largest unsorted item reaches the end.","mcqOptions":[{"text":"It only guarantees the largest unsorted item reaches the end.","correct":true,"explanation":"One pass moves the largest remaining item into its final position, but smaller items may still be out of order and require further passes."},{"text":"It only guarantees the first pair of items is compared.","correct":false,"explanation":"Bubble sort compares every relevant adjacent pair during a full pass, not just the first pair. Further passes are needed because only the largest unsorted item is guaranteed to reach the end."},{"text":"It only guarantees the smallest unsorted item reaches the beginning.","correct":false,"explanation":"The smallest item is not guaranteed to reach the beginning during a standard left-to-right pass. Only the largest unsorted item is guaranteed to reach the end."},{"text":"It only guarantees that every adjacent pair is fully sorted.","correct":false,"explanation":"A single pass does not guarantee that every adjacent pair remains ordered after later swaps. It guarantees only that the largest unsorted item reaches the end."}]},{"id":"5ffe34c1-d2d1-4000-8579-f0020010fe48","cardType":"basic","points":1,"front":"In bubble sort pseudo-code, what does swapped record?","back":"Whether a swap happened during the pass.","mcqOptions":[{"text":"Whether a swap happened during the pass.","correct":true,"explanation":"The Boolean variable is set when two adjacent items exchange positions, allowing the algorithm to detect whether any swap occurred during the entire pass."},{"text":"Whether a comparison happened during the pass.","correct":false,"explanation":"The variable does not merely record comparisons, because comparisons occur even on a sorted list. It records whether a swap happened during the pass."},{"text":"Whether an equal pair appeared during the pass.","correct":false,"explanation":"Finding an equal pair does not determine whether sorting work occurred. The variable records whether any swap happened during the pass."},{"text":"Whether the end of the list was reached during the pass.","correct":false,"explanation":"The loop counter records progress through the list, not the swapped variable. Swapped records whether two items exchanged positions during the pass."}]},{"id":"a7c83eb3-0828-4f21-b05c-e0adf4019aeb","cardType":"basic","points":2,"front":"Why can bubble sort stop after a full pass with no swaps?","back":"No swaps means the list is already sorted.","mcqOptions":[{"text":"No swaps means the list is already sorted.","correct":true,"explanation":"If no adjacent pair needs exchanging during a complete pass, every neighbouring pair is in ascending order. Therefore, the entire list is already sorted."},{"text":"No comparisons means the list is already sorted.","correct":false,"explanation":"Completing comparisons only shows that the pass finished; swaps may still have occurred. Bubble sort stops early specifically when no swaps occur, proving the list is sorted."},{"text":"No equal items means the list is already sorted.","correct":false,"explanation":"Equal adjacent values can appear in a correctly sorted list, so their absence proves nothing. A complete pass with no swaps proves the list is already sorted."},{"text":"No items remaining means the list is already sorted.","correct":false,"explanation":"Reaching the end occurs on every completed pass, including passes that make swaps. The stopping condition is a full pass with no swaps, which proves sorting is complete."}]},{"id":"86734280-0543-43b2-8c99-783047c0e55d","cardType":"basic","points":1,"front":"When is bubble sort a useful choice?","back":"For a small or nearly sorted list.","mcqOptions":[{"text":"For a small or nearly sorted list.","correct":true,"explanation":"Bubble sort is simple and can finish early when few items are misplaced, making it reasonable for small datasets or lists that are already nearly sorted."},{"text":"For a large or randomly ordered list.","correct":false,"explanation":"Bubble sort usually requires many comparisons and swaps on large, randomly ordered data. It is more suitable for a small or nearly sorted list."},{"text":"For a large or reverse-sorted list.","correct":false,"explanation":"A reverse-sorted list produces bubble sort’s worst-case behaviour because almost every comparison causes a swap. It is better suited to a small or nearly sorted list."},{"text":"For a very large or memory-limited list.","correct":false,"explanation":"Bubble sort has poor performance on very large datasets, even when memory is limited. Its practical use is mainly for a small or nearly sorted list."}]},{"id":"b3db3a55-4ffb-4526-b93f-6385a5b87d77","cardType":"cloze","points":null,"front":"Merge sort first [ ] the list, then [ ] sorted sublists.","back":"Merge sort first splits the list, then merges sorted sublists.","mcqOptions":[{"text":"Merge sort first splits the list, then merges sorted sublists.","correct":true,"explanation":"Merge sort repeatedly divides the list into smaller sublists, then combines those sublists in order. These two phases are called splitting and merging."},{"text":"Merge sort first merges the list, then splits sorted sublists.","correct":false,"explanation":"This reverses merge sort’s two phases. The algorithm must first split the original list into smaller parts and then merge the sorted sublists."},{"text":"Merge sort first compares the list, then swaps sorted sublists.","correct":false,"explanation":"Comparing and swapping adjacent items describes bubble sort rather than merge sort. Merge sort first splits the list and then merges sorted sublists."},{"text":"Merge sort first sorts the list, then divides sorted sublists.","correct":false,"explanation":"Merge sort does not begin by sorting the whole list, as that would already complete the task. It first splits the list, then merges sorted sublists."}]},{"id":"6d71c9df-380d-4a5c-be55-302a8d2ce66d","cardType":"basic","points":1,"front":"In merge sort, when does splitting stop?","back":"When each sublist has one item.","mcqOptions":[{"text":"When each sublist has one item.","correct":true,"explanation":"Splitting continues until every sublist contains exactly one item. A one-item sublist is automatically sorted and can be used in the merging phase."},{"text":"When each sublist has two items.","correct":false,"explanation":"Two-item sublists can still contain values in the wrong order, so splitting does not necessarily stop there. It continues until each sublist has one item."},{"text":"When each sublist has the same size.","correct":false,"explanation":"Equal-sized sublists may still contain many unsorted items. Merge sort keeps splitting until every resulting sublist contains one item."},{"text":"When each sublist has ascending items.","correct":false,"explanation":"Being in ascending order is not the standard stopping condition for the recursive splitting phase. Splitting stops when each sublist has one item."}]},{"id":"df8e7fe9-da67-45eb-8f63-6ad36ede5332","cardType":"basic","points":2,"front":"Why is a one-item sublist already sorted?","back":"There is nothing to compare it with.","mcqOptions":[{"text":"There is nothing to compare it with.","correct":true,"explanation":"A list containing a single value cannot have any pair in the wrong order. With nothing else to compare it against, it is already sorted."},{"text":"It is always the smallest value in the list.","correct":false,"explanation":"A one-item sublist is not sorted because its value is necessarily the smallest. It is sorted because there is nothing else to compare it with."},{"text":"It keeps its original position in the list.","correct":false,"explanation":"Its original position does not determine whether a sublist is sorted. A one-item sublist is sorted because there is nothing to compare its sole item with."},{"text":"It has already been swapped into place.","correct":false,"explanation":"No swap is required because a one-item sublist contains no pair of items, not because the item was previously swapped into place. There is nothing to compare."}]},{"id":"129629b9-b44d-45b7-b321-abf41168c904","cardType":"cloze","points":null,"front":"Splitting does not sort the list; ordering happens during [ ].","back":"Splitting does not sort the list; ordering happens during merging.","mcqOptions":[{"text":"merging","correct":true,"explanation":"Merging is the stage where items from the sorted sublists are compared and placed into the correct order in a new list."},{"text":"splitting","correct":false,"explanation":"Splitting only divides the list into smaller sublists; it does not determine their order. The correct stage is merging, when items are compared and arranged."},{"text":"partitioning","correct":false,"explanation":"Partitioning belongs to algorithms such as quick sort and separates items around a pivot. Merge sort orders items during merging, not partitioning."},{"text":"dividing","correct":false,"explanation":"Dividing creates the smaller sublists but does not sort their contents. The ordering takes place during merging, when the sublists are combined."}]},{"id":"7548935d-c7c3-4e63-8e00-69e25c2059e9","cardType":"basic","points":1,"front":"When merging two sorted sublists, which items are compared?","back":"The first remaining item in each sublist.","mcqOptions":[{"text":"The first remaining item in each sublist.","correct":true,"explanation":"Because both sublists are already sorted, only the first remaining item in each can be the next smallest item overall, so those two are compared."},{"text":"The last remaining item in each sublist.","correct":false,"explanation":"Comparing the last items ignores the sorted order from the front and can select a value too late in a sublist. The first remaining items must be compared."},{"text":"Every item in both sublists.","correct":false,"explanation":"Comparing every item is unnecessary and makes merging inefficient. The sorted structure means only the first remaining item in each sublist needs comparison."},{"text":"The middle item in each sublist.","correct":false,"explanation":"The middle items are not guaranteed to be the next smallest, especially after earlier values have been removed. The first remaining item in each sublist is compared."}]},{"id":"14dd7519-33c8-40da-a1c6-ef6a4bc1c9a6","cardType":"basic","points":1,"front":"When merging sorted sublists, which item is moved into the new list?","back":"The smaller item.","mcqOptions":[{"text":"The smaller item.","correct":true,"explanation":"The first remaining items are compared, and the smaller one must come next because all later items in its sublist are at least as large."},{"text":"The larger item.","correct":false,"explanation":"Choosing the larger item would place a later value before a smaller available value, breaking the sorted order. The smaller item is moved first."},{"text":"Both items.","correct":false,"explanation":"Moving both items at once can put them in the wrong order relative to other remaining values. The smaller item is selected one at a time."},{"text":"The item from the longer sublist.","correct":false,"explanation":"The item from the longer sublist has no necessary connection to its value. Merge sort chooses the smaller of the two compared items."}]},{"id":"2c49ace9-8af4-49de-b25c-7b44a693ce3a","cardType":"basic","points":1,"front":"What extra storage does merge sort usually need?","back":"Extra temporary lists during merging.","mcqOptions":[{"text":"Extra temporary lists during merging.","correct":true,"explanation":"Merge sort normally creates temporary lists while combining sublists, so it uses additional storage beyond the original list."},{"text":"An extra copy of the input list before sorting.","correct":false,"explanation":"Merge sort does not usually require an extra copy of the entire unsorted input as its defining storage. Its additional storage is temporary lists during merging."},{"text":"A pivot value during merging.","correct":false,"explanation":"A pivot is characteristic of quick sort, not the usual merging process. Merge sort needs temporary lists to hold results while sublists are combined."},{"text":"An extra index table for every item.","correct":false,"explanation":"A separate index table is not the usual extra storage associated with merge sort. Temporary lists are used to build the merged output."}]},{"id":"9c21aa5f-5612-45cf-ae46-7b997fb95aad","cardType":"basic","points":2,"front":"A program must sort 10,000 unsorted records. Which algorithm should it choose, and why?","back":"Choose merge sort - generally faster for larger unsorted lists.","mcqOptions":[{"text":"Choose merge sort - generally faster for larger unsorted lists.","correct":true,"explanation":"Merge sort generally has efficient $O(n\\log n)$ performance and is suitable for large unsorted lists, such as 10,000 records."},{"text":"Choose bubble sort - generally faster for larger unsorted lists.","correct":false,"explanation":"Bubble sort repeatedly compares adjacent items and is usually much slower on large unsorted lists, with average $O(n^2)$ time. Merge sort is the better choice here."},{"text":"Choose insertion sort - generally faster for larger unsorted lists.","correct":false,"explanation":"Insertion sort can be effective for small or nearly sorted data, but it is generally slower for 10,000 unsorted records. Merge sort usually scales better."},{"text":"Choose selection sort - generally faster for larger unsorted lists.","correct":false,"explanation":"Selection sort repeatedly searches for the next minimum and usually takes $O(n^2)$ comparisons. Merge sort generally performs better on a large unsorted list."}]}]}],"examCountdown":{"examDate":"2027-05-10","paperLabel":"Paper 1"},"heading":"Sorting algorithms","title":"Sorting algorithms Flashcards","topbar":{"backHref":"/gcse/computer-science/aqa/flashcards"},"topicSidebar":"$L38"}]}],"topicId":"515f5758-0686-5759-9e28-905fffdf0d67","walled":"$L39"}],"$L3a","$L3b"]