{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000540993,0.00005748479,0.00007868509,0.00006786149,0.0001584513,0.00006849089,0.0004889298,0.00001677774,0.000002059678],"category_scores_gemma":[0.00006606115,0.00003422332,0.0000261009,0.0003948697,0.00001021203,0.00007838079,0.00009012469,0.0001309064,0.000001899781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006405306,"about_ca_system_score_gemma":0.000007269484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002268017,"about_ca_topic_score_gemma":0.000007745492,"domain_scores_codex":[0.9992169,0.0001610754,0.0001189896,0.0001782502,0.0001890415,0.0001357838],"domain_scores_gemma":[0.999483,0.00007297163,0.000036721,0.0003407683,0.00002628309,0.00004017907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00000738477,0.0004665401,0.007695307,0.000001844538,0.000009778436,0.000003678397,0.01722551,0.002122922,0.001445146,0.02036862,0.0001082765,0.950545],"study_design_scores_gemma":[0.001989206,0.01029116,0.8198101,0.0002154709,0.00005019814,0.00005944075,0.01150792,0.06652721,0.00299022,0.005238831,0.08021695,0.001103282],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.680743,0.000007848568,0.3180224,0.0008900324,0.00004666927,0.0001027251,1.745123e-8,0.00008233484,0.0001050092],"genre_scores_gemma":[0.917326,2.030837e-7,0.08245189,0.0001461935,0.00001566388,7.508099e-7,4.049918e-8,0.000001890462,0.00005740458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9494417,"threshold_uncertainty_score":0.1395587,"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."}}