{"id":"W183063893","doi":"","title":"Using graphical examples to motivate the study of recursion","year":2009,"lang":"en","type":"article","venue":"","topic":"Teaching and Learning Programming","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Recursion (computer science); Computer science; sort; Mutual recursion; Pointer (user interface); Merge (version control); Theoretical computer science; Double recursion; Sorting algorithm; Divide and conquer algorithms; Data structure; Range (aeronautics); Sorting; Algorithm; Programming language; Artificial intelligence; Database; Information retrieval","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003553463,0.001398826,0.001220871,0.002538366,0.002266387,0.003959221,0.002978398,0.003598768,0.009894663],"category_scores_gemma":[0.01447528,0.001216052,0.002135197,0.00313473,0.009604258,0.009361442,0.00501659,0.005710611,0.001960435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001680895,"about_ca_system_score_gemma":0.0007529028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003057039,"about_ca_topic_score_gemma":0.002940466,"domain_scores_codex":[0.9951374,0.003612836,0.0002446932,0.0003884374,0.000418346,0.0001983469],"domain_scores_gemma":[0.9904817,0.007851795,0.0003057346,0.0007613868,0.0003841012,0.0002153419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004675695,0.000006504698,0.00006351852,0.00004235799,0.00000366368,0.00009738859,0.0003622458,0.001297929,0.000187652,0.9941765,0.0005423648,0.003215084],"study_design_scores_gemma":[0.000008459873,0.00001494377,0.00006221929,0.00005741484,0.00000760007,0.0001280633,0.00008431719,0.007345697,0.0002080718,0.975641,0.01643123,0.00001103304],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006307364,0.002360085,0.9473422,0.003496268,0.000211209,0.00004921237,0.00008216219,0.0002920689,0.03985943],"genre_scores_gemma":[0.3431888,0.004635451,0.6285214,0.001983198,0.0007532777,0.0003910149,0.0002953264,0.0006086027,0.01962285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009894663,"threshold_uncertainty_score":0.03310096,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06742595452042172,"score_gpt":0.3210305075604379,"score_spread":0.2536045530400162,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}