[{"data":1,"prerenderedAt":2570},["ShallowReactive",2],{"item-lessons-light-ch05-control-structures":3,"item-examples-light-ch05-control-structures":444,"item-exercises-light-ch05-control-structures":753,"item-lesson-full-ch05-control-structures-5.9":1070,"item-example-full-ch05-control-structures-5.9":1445,"item-exercise-full-ch05-control-structures-5.9":1786},[4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,100,104,108,112,116,120,124,128,132,136,140,144,148,152,156,160,164,168,172,176,180,184,188,192,196,200,204,208,212,216,220,224,228,232,236,240,244,248,252,256,260,264,268,272,276,280,284,288,292,296,300,304,308,312,316,320,324,328,332,336,340,344,348,352,356,360,364,368,372,376,380,384,388,392,396,400,404,408,412,416,420,424,428,432,436,440],{"path":5,"title":6,"stem":7},"\u002Fshockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1-why-java-for-frc","Why Java for FRC?","shockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1.1-why-java-for-frc",{"path":9,"title":10,"stem":11},"\u002Fshockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers","shockwave-curriculum\u002Flessons\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":13,"title":14,"stem":15},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":17,"title":18,"stem":19},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":21,"title":22,"stem":23},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":25,"title":26,"stem":27},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":29,"title":30,"stem":31},"\u002Fshockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators","shockwave-curriculum\u002Flessons\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":33,"title":34,"stem":35},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":37,"title":38,"stem":39},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":41,"title":42,"stem":43},"\u002Fshockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports","shockwave-curriculum\u002Flessons\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":45,"title":46,"stem":47},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":49,"title":50,"stem":51},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":53,"title":54,"stem":55},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":57,"title":58,"stem":59},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":61,"title":62,"stem":63},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":65,"title":66,"stem":67},"\u002Fshockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods","shockwave-curriculum\u002Flessons\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":69,"title":70,"stem":71},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","Control Structures: if Statements & For Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":73,"title":74,"stem":75},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":77,"title":78,"stem":79},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":81,"title":82,"stem":83},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":85,"title":86,"stem":87},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":89,"title":90,"stem":91},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":93,"title":94,"stem":95},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":97,"title":98,"stem":99},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":101,"title":102,"stem":103},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws)","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":105,"title":106,"stem":107},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F8-while-loops","While Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops",{"path":109,"title":110,"stem":111},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":113,"title":114,"stem":115},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F1-strings","Strings","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.1-strings",{"path":117,"title":118,"stem":119},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F2-string-algorithms","String Algorithms","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms",{"path":121,"title":122,"stem":123},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","The Class Blueprint","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":125,"title":126,"stem":127},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":129,"title":130,"stem":131},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":133,"title":134,"stem":135},"\u002Fshockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods","shockwave-curriculum\u002Flessons\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":137,"title":138,"stem":139},"\u002Fshockwave-curriculum\u002Flessons\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\"","shockwave-curriculum\u002Flessons\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":141,"title":142,"stem":143},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":145,"title":146,"stem":147},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":149,"title":150,"stem":151},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":153,"title":154,"stem":155},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":157,"title":158,"stem":159},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":161,"title":162,"stem":163},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":165,"title":166,"stem":167},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":169,"title":170,"stem":171},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":173,"title":174,"stem":175},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":177,"title":178,"stem":179},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":181,"title":182,"stem":183},"\u002Fshockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms","shockwave-curriculum\u002Flessons\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":185,"title":186,"stem":187},"\u002Fshockwave-curriculum\u002Flessons\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices","shockwave-curriculum\u002Flessons\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":189,"title":190,"stem":191},"\u002Fshockwave-curriculum\u002Flessons\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch","shockwave-curriculum\u002Flessons\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":193,"title":194,"stem":195},"\u002Fshockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas","shockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":197,"title":198,"stem":199},"\u002Fshockwave-curriculum\u002Flessons\u002Fch14-why-design-patterns\u002F14-why-design-patterns","Why Design Patterns?","shockwave-curriculum\u002Flessons\u002Fch14-why-design-patterns\u002F14-why-design-patterns",{"path":201,"title":202,"stem":203},"\u002Fshockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap)","shockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":205,"title":206,"stem":207},"\u002Fshockwave-curriculum\u002Flessons\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics","shockwave-curriculum\u002Flessons\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":209,"title":210,"stem":211},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":213,"title":214,"stem":215},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":217,"title":218,"stem":219},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":221,"title":222,"stem":223},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":225,"title":226,"stem":227},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":229,"title":230,"stem":231},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":233,"title":234,"stem":235},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":237,"title":238,"stem":239},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":241,"title":242,"stem":243},"\u002Fshockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts","shockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":245,"title":246,"stem":247},"\u002Fshockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References","shockwave-curriculum\u002Flessons\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":249,"title":250,"stem":251},"\u002Fshockwave-curriculum\u002Flessons\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern","shockwave-curriculum\u002Flessons\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":253,"title":254,"stem":255},"\u002Fshockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories","Static Factories","shockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories",{"path":257,"title":258,"stem":259},"\u002Fshockwave-curriculum\u002Flessons\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern","shockwave-curriculum\u002Flessons\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":261,"title":262,"stem":263},"\u002Fshockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability","shockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":265,"title":266,"stem":267},"\u002Fshockwave-curriculum\u002Flessons\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions","shockwave-curriculum\u002Flessons\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":269,"title":270,"stem":271},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming?","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":273,"title":274,"stem":275},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":277,"title":278,"stem":279},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":281,"title":282,"stem":283},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":285,"title":286,"stem":287},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":289,"title":290,"stem":291},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":293,"title":294,"stem":295},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":297,"title":298,"stem":299},"\u002Fshockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways","shockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":301,"title":302,"stem":303},"\u002Fshockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design","shockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":305,"title":306,"stem":307},"\u002Fshockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F2-impact-of-program-design","Impact of Program Design","shockwave-curriculum\u002Flessons\u002Fch27-program-design-and-abstraction\u002F27.2-impact-of-program-design",{"path":309,"title":310,"stem":311},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":313,"title":314,"stem":315},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":317,"title":318,"stem":319},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":321,"title":322,"stem":323},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",{"path":325,"title":326,"stem":327},"\u002Fshockwave-curriculum\u002Flessons\u002Fch29-git-and-github-basics\u002F1-coming-soon","Git & GitHub Basics — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch29-git-and-github-basics\u002F29.1-coming-soon",{"path":329,"title":330,"stem":331},"\u002Fshockwave-curriculum\u002Flessons\u002Fch30-git-history-and-merging\u002F1-coming-soon","Git — History & Merging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch30-git-history-and-merging\u002F30.1-coming-soon",{"path":333,"title":334,"stem":335},"\u002Fshockwave-curriculum\u002Flessons\u002Fch31-dev-environment-and-tooling\u002F1-coming-soon","Dev Environment & Tooling — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch31-dev-environment-and-tooling\u002F31.1-coming-soon",{"path":337,"title":338,"stem":339},"\u002Fshockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F1-coming-soon","Unit Testing — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F32.1-coming-soon",{"path":341,"title":342,"stem":343},"\u002Fshockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F1-coming-soon","AdvantageKit — AutoLogging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F33.1-coming-soon",{"path":345,"title":346,"stem":347},"\u002Fshockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F1-coming-soon","Log Replay — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F34.1-coming-soon",{"path":349,"title":350,"stem":351},"\u002Fshockwave-curriculum\u002Flessons\u002Fch35-advantagescope-i-visualization\u002F1-coming-soon","AdvantageScope I: Visualization — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch35-advantagescope-i-visualization\u002F35.1-coming-soon",{"path":353,"title":354,"stem":355},"\u002Fshockwave-curriculum\u002Flessons\u002Fch36-advantagescope-ii-custom-3d-assets\u002F1-coming-soon","AdvantageScope II: Custom 3D Assets — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch36-advantagescope-ii-custom-3d-assets\u002F36.1-coming-soon",{"path":357,"title":358,"stem":359},"\u002Fshockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F1-coming-soon","Autonomous I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F37.1-coming-soon",{"path":361,"title":362,"stem":363},"\u002Fshockwave-curriculum\u002Flessons\u002Fch38-autonomous-ii-pathplanner-and-trajectories\u002F1-coming-soon","Autonomous II: PathPlanner & Trajectories — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch38-autonomous-ii-pathplanner-and-trajectories\u002F38.1-coming-soon",{"path":365,"title":366,"stem":367},"\u002Fshockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F1-coming-soon","Control Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F39.1-coming-soon",{"path":369,"title":370,"stem":371},"\u002Fshockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F1-coming-soon","Motion Profiles — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F40.1-coming-soon",{"path":373,"title":374,"stem":375},"\u002Fshockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F1-coming-soon","Hardware Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F41.1-coming-soon",{"path":377,"title":378,"stem":379},"\u002Fshockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F1-coming-soon","PhotonVision — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F42.1-coming-soon",{"path":381,"title":382,"stem":383},"\u002Fshockwave-curriculum\u002Flessons\u002Fch43-apriltags-and-pose\u002F1-coming-soon","AprilTags & Pose — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch43-apriltags-and-pose\u002F43.1-coming-soon",{"path":385,"title":386,"stem":387},"\u002Fshockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F1-coming-soon","Subsystems I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F44.1-coming-soon",{"path":389,"title":390,"stem":391},"\u002Fshockwave-curriculum\u002Flessons\u002Fch45-subsystems-ii-advanced\u002F1-coming-soon","Subsystems II — Advanced — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch45-subsystems-ii-advanced\u002F45.1-coming-soon",{"path":393,"title":394,"stem":395},"\u002Fshockwave-curriculum\u002Flessons\u002Fch46-team-utilities-i\u002F1-coming-soon","Team Utilities I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch46-team-utilities-i\u002F46.1-coming-soon",{"path":397,"title":398,"stem":399},"\u002Fshockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F1-coming-soon","Field Constants — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F47.1-coming-soon",{"path":401,"title":402,"stem":403},"\u002Fshockwave-curriculum\u002Flessons\u002Fch48-troubleshooting-i-runtime-debug\u002F1-coming-soon","Troubleshooting I — Runtime Debug — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch48-troubleshooting-i-runtime-debug\u002F48.1-coming-soon",{"path":405,"title":406,"stem":407},"\u002Fshockwave-curriculum\u002Flessons\u002Fch49-troubleshooting-ii-can-and-sim\u002F1-coming-soon","Troubleshooting II: CAN & Sim — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch49-troubleshooting-ii-can-and-sim\u002F49.1-coming-soon",{"path":409,"title":410,"stem":411},"\u002Fshockwave-curriculum\u002Flessons\u002Fch50-vendor-libraries-talonfx\u002F1-coming-soon","Vendor Libraries: TalonFX — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch50-vendor-libraries-talonfx\u002F50.1-coming-soon",{"path":413,"title":414,"stem":415},"\u002Fshockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F1-coming-soon","Robot Alerts — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F51.1-coming-soon",{"path":417,"title":418,"stem":419},"\u002Fshockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F1-coming-soon","WPILib Commands — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F52.1-coming-soon",{"path":421,"title":422,"stem":423},"\u002Fshockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F1-coming-soon","WPILib Geometry — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F53.1-coming-soon",{"path":425,"title":426,"stem":427},"\u002Fshockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F1-coming-soon","NetworkTables — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F54.1-coming-soon",{"path":429,"title":430,"stem":431},"\u002Fshockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F1-coming-soon","Command Scheduler — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F55.1-coming-soon",{"path":433,"title":434,"stem":435},"\u002Fshockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F1-coming-soon","WPILib Timers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F56.1-coming-soon",{"path":437,"title":438,"stem":439},"\u002Fshockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F1-coming-soon","WPILib Triggers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F57.1-coming-soon",{"path":441,"title":442,"stem":443},"\u002Fshockwave-curriculum\u002Flessons\u002Fch58-vendor-units-and-conversions\u002F1-coming-soon","Vendor Units & Conversions — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch58-vendor-units-and-conversions\u002F58.1-coming-soon",[445,449,453,457,461,465,469,473,477,481,485,489,493,497,501,505,509,513,517,521,525,529,533,537,541,545,549,553,557,561,565,569,573,577,581,585,589,593,597,601,605,609,613,617,621,625,629,633,637,641,645,649,653,657,661,665,669,673,677,681,685,689,693,697,701,705,709,713,717,721,725,729,733,737,741,745,749],{"path":446,"title":447,"stem":448},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":450,"title":451,"stem":452},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":454,"title":455,"stem":456},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":458,"title":459,"stem":460},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":462,"title":463,"stem":464},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":466,"title":467,"stem":468},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":470,"title":471,"stem":472},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":474,"title":475,"stem":476},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":478,"title":479,"stem":480},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":482,"title":483,"stem":484},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":486,"title":487,"stem":488},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":490,"title":491,"stem":492},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":494,"title":495,"stem":496},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":498,"title":499,"stem":500},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":502,"title":503,"stem":504},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":506,"title":507,"stem":508},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","if Statements & For Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":510,"title":511,"stem":512},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":514,"title":515,"stem":516},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":518,"title":519,"stem":520},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":522,"title":523,"stem":524},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":526,"title":527,"stem":528},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":530,"title":531,"stem":532},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":534,"title":535,"stem":536},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":538,"title":539,"stem":540},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws) — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":542,"title":543,"stem":544},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F8-while-loops","While Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.8-while-loops",{"path":546,"title":547,"stem":548},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":550,"title":551,"stem":552},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F1-strings","Strings — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.1-strings",{"path":554,"title":555,"stem":556},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms",{"path":558,"title":559,"stem":560},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","Anatomy of a Java Class — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":562,"title":563,"stem":564},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":566,"title":567,"stem":568},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":570,"title":571,"stem":572},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":574,"title":575,"stem":576},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\" — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":578,"title":579,"stem":580},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":582,"title":583,"stem":584},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":586,"title":587,"stem":588},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":590,"title":591,"stem":592},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":594,"title":595,"stem":596},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":598,"title":599,"stem":600},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":602,"title":603,"stem":604},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":606,"title":607,"stem":608},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":610,"title":611,"stem":612},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":614,"title":615,"stem":616},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":618,"title":619,"stem":620},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":622,"title":623,"stem":624},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":626,"title":627,"stem":628},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":630,"title":631,"stem":632},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":634,"title":635,"stem":636},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap) — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":638,"title":639,"stem":640},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":642,"title":643,"stem":644},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":646,"title":647,"stem":648},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":650,"title":651,"stem":652},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":654,"title":655,"stem":656},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":658,"title":659,"stem":660},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":662,"title":663,"stem":664},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":666,"title":667,"stem":668},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":670,"title":671,"stem":672},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":674,"title":675,"stem":676},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":678,"title":679,"stem":680},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":682,"title":683,"stem":684},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":686,"title":687,"stem":688},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch21-static-factories\u002F21-static-factories","Static Factories — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch21-static-factories\u002F21-static-factories",{"path":690,"title":691,"stem":692},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":694,"title":695,"stem":696},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":698,"title":699,"stem":700},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":702,"title":703,"stem":704},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming? — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":706,"title":707,"stem":708},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":710,"title":711,"stem":712},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":714,"title":715,"stem":716},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":718,"title":719,"stem":720},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":722,"title":723,"stem":724},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":726,"title":727,"stem":728},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":730,"title":731,"stem":732},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":734,"title":735,"stem":736},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":738,"title":739,"stem":740},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":742,"title":743,"stem":744},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":746,"title":747,"stem":748},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":750,"title":751,"stem":752},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",[754,758,762,766,770,774,778,782,786,790,794,798,802,806,810,814,818,822,826,830,834,838,842,846,850,854,858,862,866,870,874,878,882,886,890,894,898,902,906,910,914,918,922,926,930,934,938,942,946,950,954,958,962,966,970,974,978,982,986,990,994,998,1002,1006,1010,1014,1018,1022,1026,1030,1034,1038,1042,1046,1050,1054,1058,1062,1066],{"path":755,"title":756,"stem":757},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming and Compilers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":759,"title":760,"stem":761},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F1-variables-and-data-types","Variables & Data Types — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.1-variables-and-data-types",{"path":763,"title":764,"stem":765},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2-expressions-and-output","Expressions & Output — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.2-expressions-and-output",{"path":767,"title":768,"stem":769},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F3-assignment-and-input","Assignment & Input — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.3-assignment-and-input",{"path":771,"title":772,"stem":773},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F4-casting-and-ranges-of-values","Casting & Ranges of Values — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.4-casting-and-ranges-of-values",{"path":775,"title":776,"stem":777},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F5-compound-assignment-operators","Compound Assignment Operators — Exercises","shockwave-curriculum\u002Fexercises\u002Fch02-variables-and-types\u002F2.5-compound-assignment-operators",{"path":779,"title":780,"stem":781},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F1-apis-and-libraries","APIs and Libraries — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.1-apis-and-libraries",{"path":783,"title":784,"stem":785},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F2-documentation-with-comments-and-preconditions","Documentation with Comments and Preconditions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.2-documentation-with-comments-and-preconditions",{"path":787,"title":788,"stem":789},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3-packages-and-imports","Packages & Imports — Exercises","shockwave-curriculum\u002Fexercises\u002Fch03-apis-libraries-and-documentation\u002F3.3-packages-and-imports",{"path":791,"title":792,"stem":793},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F1-methods-signatures-and-parameters","Methods, Signatures & Parameters — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.1-methods-signatures-and-parameters",{"path":795,"title":796,"stem":797},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F2-calling-class-methods","Calling Class Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.2-calling-class-methods",{"path":799,"title":800,"stem":801},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F3-using-the-math-class","Using the Math Class — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.3-using-the-math-class",{"path":803,"title":804,"stem":805},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4-objects-instances-of-classes","Objects — Instances of Classes — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.4-objects-instances-of-classes",{"path":807,"title":808,"stem":809},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F5-creating-and-initializing-objects-constructors","Creating & Initializing Objects: Constructors — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.5-creating-and-initializing-objects-constructors",{"path":811,"title":812,"stem":813},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F6-calling-instance-methods","Calling Instance Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch04-using-objects-and-calling-methods\u002F4.6-calling-instance-methods",{"path":815,"title":816,"stem":817},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F1-5.2-if-statements-and-for-loops","if Statements & For Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.1-5.2-if-statements-and-for-loops",{"path":819,"title":820,"stem":821},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":823,"title":824,"stem":825},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F11-informal-runtime-analysis-of-loops","Informal Runtime Analysis of Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.11-informal-runtime-analysis-of-loops",{"path":827,"title":828,"stem":829},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F12-switch-statements-and-expressions","switch Statements and Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.12-switch-statements-and-expressions",{"path":831,"title":832,"stem":833},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F3-algorithms-with-selection-and-repetition","Algorithms with Selection and Repetition — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.3-algorithms-with-selection-and-repetition",{"path":835,"title":836,"stem":837},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":839,"title":840,"stem":841},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5-nested-if-statements","Nested if Statements — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.5-nested-if-statements",{"path":843,"title":844,"stem":845},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F6-compound-boolean-expressions","Compound Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.6-compound-boolean-expressions",{"path":847,"title":848,"stem":849},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F7-comparing-boolean-expressions-de-morgans-laws","Comparing Boolean Expressions (De Morgan's Laws) — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.7-comparing-boolean-expressions-de-morgans-laws",{"path":851,"title":852,"stem":853},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F8-while-loops","While Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.8-while-loops",{"path":855,"title":856,"stem":857},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F9-implementing-selection-and-iteration-algorithms","Implementing Selection and Iteration Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms",{"path":859,"title":860,"stem":861},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F1-strings","Strings — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.1-strings",{"path":863,"title":864,"stem":865},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms",{"path":867,"title":868,"stem":869},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F1-anatomy-of-a-java-class","Anatomy of a Java Class — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.1-anatomy-of-a-java-class",{"path":871,"title":872,"stem":873},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F2-methods-how-to-write-them","Methods: How to Write Them — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.2-methods-how-to-write-them",{"path":875,"title":876,"stem":877},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F3-methods-passing-and-returning-references-of-an-object","Methods: Passing & Returning References of an Object — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.3-methods-passing-and-returning-references-of-an-object",{"path":879,"title":880,"stem":881},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F4-class-static-variables-and-methods","Class (static) Variables & Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch07-the-class-blueprint\u002F7.4-class-static-variables-and-methods",{"path":883,"title":884,"stem":885},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch08-constructors-and-this\u002F1-8.2-constructors-and-this","Constructors & \"this\" — Exercises","shockwave-curriculum\u002Fexercises\u002Fch08-constructors-and-this\u002F8.1-8.2-constructors-and-this",{"path":887,"title":888,"stem":889},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F1-array-creation-and-access","Array Creation and Access — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.1-array-creation-and-access",{"path":891,"title":892,"stem":893},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F2-arraylist-and-its-methods","ArrayList and its Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.2-arraylist-and-its-methods",{"path":895,"title":896,"stem":897},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","HashMap (Dictionary) Data Structure — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":899,"title":900,"stem":901},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":903,"title":904,"stem":905},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F5-implementing-array-algorithms","Implementing Array Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms",{"path":907,"title":908,"stem":909},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":911,"title":912,"stem":913},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F7-implementing-arraylist-algorithms","Implementing ArrayList Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.7-implementing-arraylist-algorithms",{"path":915,"title":916,"stem":917},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F8-using-text-files","Using Text Files — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.8-using-text-files",{"path":919,"title":920,"stem":921},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F1-2d-array-creation-and-access","2D Array Creation and Access — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.1-2d-array-creation-and-access",{"path":923,"title":924,"stem":925},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F2-2d-array-traversals-nested-loops","2D Array Traversals: Nested Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.2-2d-array-traversals-nested-loops",{"path":927,"title":928,"stem":929},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F3-implementing-2d-array-algorithms","Implementing 2D Array Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch10-2d-arrays\u002F10.3-implementing-2d-array-algorithms",{"path":931,"title":932,"stem":933},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch11-enums-named-choices\u002F11-enums-named-choices","Enums: Named Choices — Exercises","shockwave-curriculum\u002Fexercises\u002Fch11-enums-named-choices\u002F11-enums-named-choices",{"path":935,"title":936,"stem":937},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch","Exceptions & try\u002Fcatch — Exercises","shockwave-curriculum\u002Fexercises\u002Fch12-exceptions-and-try-catch\u002F12-exceptions-and-try-catch",{"path":939,"title":940,"stem":941},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas — Exercises","shockwave-curriculum\u002Fexercises\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":943,"title":944,"stem":945},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch14-why-design-patterns\u002F14-why-design-patterns","Why Design Patterns? — Exercises","shockwave-curriculum\u002Fexercises\u002Fch14-why-design-patterns\u002F14-why-design-patterns",{"path":947,"title":948,"stem":949},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap) — Exercises","shockwave-curriculum\u002Fexercises\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":951,"title":952,"stem":953},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics","Writing Your Own Generics — Exercises","shockwave-curriculum\u002Fexercises\u002Fch16-writing-your-own-generics\u002F16-writing-your-own-generics",{"path":955,"title":956,"stem":957},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F1-inheritance-superclass-subclass","Inheritance, Superclass, Subclass — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.1-inheritance-superclass-subclass",{"path":959,"title":960,"stem":961},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F2-inheritance-and-constructors","Inheritance and Constructors — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.2-inheritance-and-constructors",{"path":963,"title":964,"stem":965},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":967,"title":968,"stem":969},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":971,"title":972,"stem":973},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F5-abstract-classes-and-methods","Abstract Classes and Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch17-inheritance-and-abstractions\u002F17.5-abstract-classes-and-methods",{"path":975,"title":976,"stem":977},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":979,"title":980,"stem":981},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":983,"title":984,"stem":985},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism — Exercises","shockwave-curriculum\u002Fexercises\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":987,"title":988,"stem":989},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts","Interfaces as Contracts — Exercises","shockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19-interfaces-as-contracts",{"path":991,"title":992,"stem":993},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F1-lambdas-and-method-references","Lambdas & Method References — Exercises","shockwave-curriculum\u002Fexercises\u002Fch19-interfaces-as-contracts\u002F19.1-lambdas-and-method-references",{"path":995,"title":996,"stem":997},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern","The IO-Layer Pattern — Exercises","shockwave-curriculum\u002Fexercises\u002Fch20-the-io-layer-pattern\u002F20-the-io-layer-pattern",{"path":999,"title":1000,"stem":1001},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch21-static-factories\u002F21-static-factories","Static Factories — Exercises","shockwave-curriculum\u002Fexercises\u002Fch21-static-factories\u002F21-static-factories",{"path":1003,"title":1004,"stem":1005},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern","The Builder Pattern — Exercises","shockwave-curriculum\u002Fexercises\u002Fch22-the-builder-pattern\u002F22-the-builder-pattern",{"path":1007,"title":1008,"stem":1009},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Access, final, and Immutability — Exercises","shockwave-curriculum\u002Fexercises\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":1011,"title":1012,"stem":1013},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions","Optional: Avoiding Null Pointer Exceptions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch24-optional-avoiding-null-pointer-exceptions\u002F24-optional-avoiding-null-pointer-exceptions",{"path":1015,"title":1016,"stem":1017},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F1-what-is-command-based-programming","What Is Command-Based Programming? — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.1-what-is-command-based-programming",{"path":1019,"title":1020,"stem":1021},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F2-commands-and-command-compositions","Commands & Command Compositions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.2-commands-and-command-compositions",{"path":1023,"title":1024,"stem":1025},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F3-the-command-scheduler","The Command Scheduler — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.3-the-command-scheduler",{"path":1027,"title":1028,"stem":1029},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F4-state-machines-logic","State Machines: Logic — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.4-state-machines-logic",{"path":1031,"title":1032,"stem":1033},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":1035,"title":1036,"stem":1037},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F6-binding-commands-to-triggers","Binding Commands to Triggers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.6-binding-commands-to-triggers",{"path":1039,"title":1040,"stem":1041},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F7-structuring-a-command-based-robot-project","Structuring a Command-Based Robot Project — Exercises","shockwave-curriculum\u002Fexercises\u002Fch25-command-based-programming\u002F25.7-structuring-a-command-based-robot-project",{"path":1043,"title":1044,"stem":1045},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways — Exercises","shockwave-curriculum\u002Fexercises\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":1047,"title":1048,"stem":1049},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F1-abstraction-and-program-design","Abstraction and Program Design — Exercises","shockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F27.1-abstraction-and-program-design",{"path":1051,"title":1052,"stem":1053},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F2-impact-of-program-design","Impact of Program Design — Exercises","shockwave-curriculum\u002Fexercises\u002Fch27-program-design-and-abstraction\u002F27.2-impact-of-program-design",{"path":1055,"title":1056,"stem":1057},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F1-searching-algorithms","Searching Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.1-searching-algorithms",{"path":1059,"title":1060,"stem":1061},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F2-sorting-algorithms","Sorting Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.2-sorting-algorithms",{"path":1063,"title":1064,"stem":1065},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":1067,"title":1068,"stem":1069},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F4-recursive-searching-and-sorting","Recursive Searching and Sorting — Exercises","shockwave-curriculum\u002Fexercises\u002Fch28-algorithms-searching-sorting-recursion\u002F28.4-recursive-searching-and-sorting",{"id":1071,"title":110,"body":1072,"description":1082,"extension":1438,"meta":1439,"navigation":1442,"path":109,"seo":1443,"stem":111,"__hash__":1444},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms.md",{"type":1073,"value":1074,"toc":1430},"minimark",[1075,1079,1083,1113,1118,1121,1168,1172,1179,1223,1255,1259,1262,1303,1307,1316,1339,1343,1389,1393,1415,1426],[1076,1077,110],"h1",{"id":1078},"implementing-selection-and-iteration-algorithms",[1080,1081,1082],"p",{},"A handful of loop-and-selection patterns come up constantly. Once you recognize them, you'll see the same shape everywhere.",[1080,1084,1085],{},[1086,1087,1088,1089,1093,1094,1097,1098,1101,1102,1105,1106,1109,1110,1112],"em",{},"The examples below loop over an existing collection (",[1090,1091,1092],"code",{},"visionLatencies",", ",[1090,1095,1096],{},"sensors",") with an enhanced ",[1090,1099,1100],{},"for"," — building your own comes in Ch.9. Read ",[1090,1103,1104],{},"for (double sample : visionLatencies)"," as \"for each ",[1090,1107,1108],{},"sample"," in ",[1090,1111,1092],{},"\": the loop variable takes each value in turn, first to last, with no index to manage (Lesson 9.4 covers it fully). For now, focus on the accumulator\u002Fselection shape itself; it applies the same way once you get there.",[1114,1115,1117],"h2",{"id":1116},"the-accumulator-pattern","The Accumulator Pattern",[1080,1119,1120],{},"Build up a running total across a loop: initialize before the loop, update inside it, use the result after.",[1122,1123,1128],"pre",{"className":1124,"code":1125,"language":1126,"meta":1127,"style":1127},"language-java shiki shiki-themes github-light github-dark","double sum = 0;\nfor (double sample : visionLatencies)\n{\n    sum += sample; \u002F\u002F accumulate\n}\ndouble average = sum \u002F visionLatencies.size();\n","java","",[1090,1129,1130,1138,1144,1150,1156,1162],{"__ignoreMap":1127},[1131,1132,1135],"span",{"class":1133,"line":1134},"line",1,[1131,1136,1137],{},"double sum = 0;\n",[1131,1139,1141],{"class":1133,"line":1140},2,[1131,1142,1143],{},"for (double sample : visionLatencies)\n",[1131,1145,1147],{"class":1133,"line":1146},3,[1131,1148,1149],{},"{\n",[1131,1151,1153],{"class":1133,"line":1152},4,[1131,1154,1155],{},"    sum += sample; \u002F\u002F accumulate\n",[1131,1157,1159],{"class":1133,"line":1158},5,[1131,1160,1161],{},"}\n",[1131,1163,1165],{"class":1133,"line":1164},6,[1131,1166,1167],{},"double average = sum \u002F visionLatencies.size();\n",[1114,1169,1171],{"id":1170},"minmax-with-an-if-inside-a-loop","Min\u002FMax with an if Inside a Loop",[1080,1173,1174,1175,1178],{},"Track the smallest or largest value seen so far by pairing an accumulator with an ",[1090,1176,1177],{},"if"," inside the loop:",[1122,1180,1182],{"className":1124,"code":1181,"language":1126,"meta":1127,"style":1127},"double max = Double.NEGATIVE_INFINITY; \u002F\u002F below every real number\nfor (double sample : visionLatencies)\n{\n    if (sample > max)\n    {\n        max = sample; \u002F\u002F running max\n    }\n}\n",[1090,1183,1184,1189,1193,1197,1202,1207,1212,1218],{"__ignoreMap":1127},[1131,1185,1186],{"class":1133,"line":1134},[1131,1187,1188],{},"double max = Double.NEGATIVE_INFINITY; \u002F\u002F below every real number\n",[1131,1190,1191],{"class":1133,"line":1140},[1131,1192,1143],{},[1131,1194,1195],{"class":1133,"line":1146},[1131,1196,1149],{},[1131,1198,1199],{"class":1133,"line":1152},[1131,1200,1201],{},"    if (sample > max)\n",[1131,1203,1204],{"class":1133,"line":1158},[1131,1205,1206],{},"    {\n",[1131,1208,1209],{"class":1133,"line":1164},[1131,1210,1211],{},"        max = sample; \u002F\u002F running max\n",[1131,1213,1215],{"class":1133,"line":1214},7,[1131,1216,1217],{},"    }\n",[1131,1219,1221],{"class":1133,"line":1220},8,[1131,1222,1161],{},[1080,1224,1225,1228,1229,1232,1233,1236,1237,1239,1240,1243,1244,1247,1248,1250,1251,1254],{},[1090,1226,1227],{},"Double.NEGATIVE_INFINITY"," is a special ",[1090,1230,1231],{},"double"," value smaller than every real number, so the first sample always replaces it. (",[1090,1234,1235],{},"Double"," is Java's wrapper class for ",[1090,1238,1231],{},"; its constants and the other wrapper classes come in Lesson 9.2.) Watch out for the similar-looking ",[1090,1241,1242],{},"Double.MIN_VALUE",": despite the name, it's the smallest ",[1086,1245,1246],{},"positive"," ",[1090,1249,1231],{}," (about ",[1090,1252,1253],{},"4.9E-324","), so a max seeded with it stays wrong whenever every sample is zero or negative.",[1114,1256,1258],{"id":1257},"frequency-counting","Frequency Counting",[1080,1260,1261],{},"Count how many values in a sequence meet some criterion, using a counter incremented inside a conditional:",[1122,1263,1265],{"className":1124,"code":1264,"language":1126,"meta":1127,"style":1127},"int faultyCount = 0;\nfor (Sensor sensor : sensors)\n{\n    if (sensor.isFaulty())\n    {\n        faultyCount++;\n    }\n}\n",[1090,1266,1267,1272,1277,1281,1286,1290,1295,1299],{"__ignoreMap":1127},[1131,1268,1269],{"class":1133,"line":1134},[1131,1270,1271],{},"int faultyCount = 0;\n",[1131,1273,1274],{"class":1133,"line":1140},[1131,1275,1276],{},"for (Sensor sensor : sensors)\n",[1131,1278,1279],{"class":1133,"line":1146},[1131,1280,1149],{},[1131,1282,1283],{"class":1133,"line":1152},[1131,1284,1285],{},"    if (sensor.isFaulty())\n",[1131,1287,1288],{"class":1133,"line":1158},[1131,1289,1206],{},[1131,1291,1292],{"class":1133,"line":1164},[1131,1293,1294],{},"        faultyCount++;\n",[1131,1296,1297],{"class":1133,"line":1214},[1131,1298,1217],{},[1131,1300,1301],{"class":1133,"line":1220},[1131,1302,1161],{},[1114,1304,1306],{"id":1305},"simulating-probability-with-mathrandom","Simulating Probability with Math.random()",[1080,1308,1309,1312,1313,1315],{},[1090,1310,1311],{},"Math.random() \u003C p"," is true with probability ",[1090,1314,1080],{}," — a real way to simulate an event that happens some percentage of the time (useful for testing code against randomized simulated sensor noise, for instance):",[1122,1317,1319],{"className":1124,"code":1318,"language":1126,"meta":1127,"style":1127},"if (Math.random() \u003C 0.1) \u002F\u002F roughly 10% of the time\n{\n    simulateSensorGlitch();\n}\n",[1090,1320,1321,1326,1330,1335],{"__ignoreMap":1127},[1131,1322,1323],{"class":1133,"line":1134},[1131,1324,1325],{},"if (Math.random() \u003C 0.1) \u002F\u002F roughly 10% of the time\n",[1131,1327,1328],{"class":1133,"line":1140},[1131,1329,1149],{},[1131,1331,1332],{"class":1133,"line":1146},[1131,1333,1334],{},"    simulateSensorGlitch();\n",[1131,1336,1337],{"class":1133,"line":1152},[1131,1338,1161],{},[1114,1340,1342],{"id":1341},"common-pitfalls","Common Pitfalls",[1344,1345,1346,1379],"ul",{},[1347,1348,1349,1353,1354,1357,1358,1360,1361,1093,1363,1366,1367,1370,1371,1373,1374,1247,1376,1378],"li",{},[1350,1351,1352],"strong",{},"Initializing an accumulator with the wrong starting value."," A sum starts at ",[1090,1355,1356],{},"0","; a max should start below every possible value (",[1090,1359,1227],{}," for a ",[1090,1362,1231],{},[1090,1364,1365],{},"Integer.MIN_VALUE"," for an ",[1090,1368,1369],{},"int",") so the very first real value always replaces it. Not ",[1090,1372,1242],{}," — that's the smallest ",[1086,1375,1246],{},[1090,1377,1231],{},", not the most negative one.",[1347,1380,1381,1384,1385,1388],{},[1350,1382,1383],{},"Putting the accumulator update outside the loop."," It has to be ",[1086,1386,1387],{},"inside"," the loop body to actually accumulate across every iteration.",[1114,1390,1392],{"id":1391},"key-takeaways","Key Takeaways",[1344,1394,1395,1398,1404,1407],{},[1347,1396,1397],{},"The accumulator pattern: initialize before the loop, update inside it, use the result after.",[1347,1399,1400,1401,1403],{},"Min\u002Fmax tracking pairs an accumulator with an ",[1090,1402,1177],{}," inside the loop, comparing each new value against the best one seen so far.",[1347,1405,1406],{},"Frequency counting increments a counter inside a conditional, once per matching iteration.",[1347,1408,1409,1411,1412,1414],{},[1090,1410,1311],{}," simulates an event with probability ",[1090,1413,1080],{},".",[1080,1416,1417,1418,1421,1422,1425],{},"Derived from ",[1090,1419,1420],{},"csawesome-2026",": ",[1090,1423,1424],{},"unit-2-selection-and-iteration\u002F2.09-implementing-selection-and-iteration-algorithms.md"," (CSA 2.9)",[1427,1428,1429],"style",{},"html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}",{"title":1127,"searchDepth":1140,"depth":1140,"links":1431},[1432,1433,1434,1435,1436,1437],{"id":1116,"depth":1140,"text":1117},{"id":1170,"depth":1140,"text":1171},{"id":1257,"depth":1140,"text":1258},{"id":1305,"depth":1140,"text":1306},{"id":1341,"depth":1140,"text":1342},{"id":1391,"depth":1140,"text":1392},"md",{"outlineRef":1440,"status":1441},"5.9 — Implementing Selection and Iteration Algorithms (CSA 2.9)","new — authored lesson (fuller depth than the teaser slide)",true,{"title":110,"description":1082},"mf26x_AIC9kv4dZoTq1lsS6pSgo4iA3SfNjE0gx9e90",{"id":1446,"title":547,"body":1447,"description":1127,"extension":1438,"meta":1781,"navigation":1442,"path":546,"seo":1784,"stem":548,"__hash__":1785},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms.md",{"type":1073,"value":1448,"toc":1772},[1449,1452,1456,1462,1466,1475,1508,1512,1515,1553,1566,1570,1576,1622,1637,1641,1644,1689,1702,1706,1724,1747,1750,1754,1770],[1076,1450,547],{"id":1451},"implementing-selection-and-iteration-algorithms-worked-example",[1114,1453,1455],{"id":1454},"problem","Problem",[1080,1457,1458,1459,1461],{},"Given the points scored in each of 6 practice runs, compute and print: the average score, the highest score, and how many runs scored ",[1090,1460,1356],{}," points. Then simulate a 15% chance of a \"bonus token\" spawning during one more practice run.",[1114,1463,1465],{"id":1464},"step-1-start-from-the-data","Step 1: Start From the Data",[1122,1467,1469],{"className":1124,"code":1468,"language":1126,"meta":1127,"style":1127},"int[] practiceScores = {12, 0, 20, 15, 0, 18};\n",[1090,1470,1471],{"__ignoreMap":1127},[1131,1472,1473],{"class":1133,"line":1134},[1131,1474,1468],{},[1080,1476,1477],{},[1086,1478,1479,1480,1483,1484,1487,1488,1490,1491,1494,1495,1497,1498,1105,1501,1109,1504,1507],{},"Arrays are covered fully in Ch.9 — here, just read ",[1090,1481,1482],{},"practiceScores[i]"," as \"item ",[1090,1485,1486],{},"i"," of the list\" (counting from ",[1090,1489,1356],{},"), and ",[1090,1492,1493],{},"practiceScores.length"," as how many items it holds. The loops below use an enhanced ",[1090,1496,1100],{},": read ",[1090,1499,1500],{},"for (int score : practiceScores)",[1090,1502,1503],{},"score",[1090,1505,1506],{},"practiceScores","\" — the loop variable takes each value in turn, first to last, with no index to manage (Lesson 9.4 covers it fully).",[1114,1509,1511],{"id":1510},"step-2-the-accumulator-pattern-average","Step 2: The Accumulator Pattern — Average",[1080,1513,1514],{},"Initialize a running total before the loop, add to it inside the loop, then use the result after the loop ends:",[1122,1516,1518],{"className":1124,"code":1517,"language":1126,"meta":1127,"style":1127},"int sum = 0;\nfor (int score : practiceScores)\n{\n    sum += score;\n}\ndouble average = sum \u002F (double) practiceScores.length;\nSystem.out.println(\"Average: \" + average);\n",[1090,1519,1520,1525,1530,1534,1539,1543,1548],{"__ignoreMap":1127},[1131,1521,1522],{"class":1133,"line":1134},[1131,1523,1524],{},"int sum = 0;\n",[1131,1526,1527],{"class":1133,"line":1140},[1131,1528,1529],{},"for (int score : practiceScores)\n",[1131,1531,1532],{"class":1133,"line":1146},[1131,1533,1149],{},[1131,1535,1536],{"class":1133,"line":1152},[1131,1537,1538],{},"    sum += score;\n",[1131,1540,1541],{"class":1133,"line":1158},[1131,1542,1161],{},[1131,1544,1545],{"class":1133,"line":1164},[1131,1546,1547],{},"double average = sum \u002F (double) practiceScores.length;\n",[1131,1549,1550],{"class":1133,"line":1214},[1131,1551,1552],{},"System.out.println(\"Average: \" + average);\n",[1080,1554,1555,1558,1559,1561,1562,1565],{},[1090,1556,1557],{},"sum"," has to start at ",[1090,1560,1356],{}," — the identity value for addition — so the first real score adds in correctly. Casting to ",[1090,1563,1564],{},"(double)"," before dividing avoids integer division truncating the result.",[1114,1567,1569],{"id":1568},"step-3-minmax-pattern-highest-score","Step 3: Min\u002FMax Pattern — Highest Score",[1080,1571,1572,1573,1575],{},"Pair an accumulator with an ",[1090,1574,1177],{}," inside the loop, comparing each new value against the best one seen so far:",[1122,1577,1579],{"className":1124,"code":1578,"language":1126,"meta":1127,"style":1127},"int max = Integer.MIN_VALUE;\nfor (int score : practiceScores)\n{\n    if (score > max)\n    {\n        max = score;\n    }\n}\nSystem.out.println(\"Highest: \" + max);\n",[1090,1580,1581,1586,1590,1594,1599,1603,1608,1612,1616],{"__ignoreMap":1127},[1131,1582,1583],{"class":1133,"line":1134},[1131,1584,1585],{},"int max = Integer.MIN_VALUE;\n",[1131,1587,1588],{"class":1133,"line":1140},[1131,1589,1529],{},[1131,1591,1592],{"class":1133,"line":1146},[1131,1593,1149],{},[1131,1595,1596],{"class":1133,"line":1152},[1131,1597,1598],{},"    if (score > max)\n",[1131,1600,1601],{"class":1133,"line":1158},[1131,1602,1206],{},[1131,1604,1605],{"class":1133,"line":1164},[1131,1606,1607],{},"        max = score;\n",[1131,1609,1610],{"class":1133,"line":1214},[1131,1611,1217],{},[1131,1613,1614],{"class":1133,"line":1220},[1131,1615,1161],{},[1131,1617,1619],{"class":1133,"line":1618},9,[1131,1620,1621],{},"System.out.println(\"Highest: \" + max);\n",[1080,1623,1624,1627,1628,1630,1631,1633,1634,1636],{},[1090,1625,1626],{},"max"," starts at the smallest possible ",[1090,1629,1369],{}," specifically so that the very first real score is guaranteed to be greater than it, replacing it immediately. Starting ",[1090,1632,1626],{}," at ",[1090,1635,1356],{}," instead would silently break this the moment every score happened to be negative.",[1114,1638,1640],{"id":1639},"step-4-frequency-counting-runs-scoring-zero","Step 4: Frequency Counting — Runs Scoring Zero",[1080,1642,1643],{},"A counter incremented inside a conditional, once per matching iteration:",[1122,1645,1647],{"className":1124,"code":1646,"language":1126,"meta":1127,"style":1127},"int zeroCount = 0;\nfor (int score : practiceScores)\n{\n    if (score == 0)\n    {\n        zeroCount++;\n    }\n}\nSystem.out.println(\"Scoreless runs: \" + zeroCount);\n",[1090,1648,1649,1654,1658,1662,1667,1671,1676,1680,1684],{"__ignoreMap":1127},[1131,1650,1651],{"class":1133,"line":1134},[1131,1652,1653],{},"int zeroCount = 0;\n",[1131,1655,1656],{"class":1133,"line":1140},[1131,1657,1529],{},[1131,1659,1660],{"class":1133,"line":1146},[1131,1661,1149],{},[1131,1663,1664],{"class":1133,"line":1152},[1131,1665,1666],{},"    if (score == 0)\n",[1131,1668,1669],{"class":1133,"line":1158},[1131,1670,1206],{},[1131,1672,1673],{"class":1133,"line":1164},[1131,1674,1675],{},"        zeroCount++;\n",[1131,1677,1678],{"class":1133,"line":1214},[1131,1679,1217],{},[1131,1681,1682],{"class":1133,"line":1220},[1131,1683,1161],{},[1131,1685,1686],{"class":1133,"line":1618},[1131,1687,1688],{},"System.out.println(\"Scoreless runs: \" + zeroCount);\n",[1080,1690,1691,1692,1695,1696,1698,1699,1701],{},"The increment (",[1090,1693,1694],{},"zeroCount++",") has to live ",[1086,1697,1387],{}," the ",[1090,1700,1177],{},", not the loop body unconditionally — otherwise it would count every run, not just the matching ones.",[1114,1703,1705],{"id":1704},"step-5-simulating-probability","Step 5: Simulating Probability",[1080,1707,1708,1711,1712,1715,1716,1719,1720,1723],{},[1090,1709,1710],{},"Math.random()"," returns a value from ",[1090,1713,1714],{},"0.0"," up to (not including) ",[1090,1717,1718],{},"1.0",", spread evenly — so ",[1090,1721,1722],{},"Math.random() \u003C 0.15"," is true roughly 15% of the time:",[1122,1725,1727],{"className":1124,"code":1726,"language":1126,"meta":1127,"style":1127},"if (Math.random() \u003C 0.15)\n{\n    System.out.println(\"Bonus token spawned!\");\n}\n",[1090,1728,1729,1734,1738,1743],{"__ignoreMap":1127},[1131,1730,1731],{"class":1133,"line":1134},[1131,1732,1733],{},"if (Math.random() \u003C 0.15)\n",[1131,1735,1736],{"class":1133,"line":1140},[1131,1737,1149],{},[1131,1739,1740],{"class":1133,"line":1146},[1131,1741,1742],{},"    System.out.println(\"Bonus token spawned!\");\n",[1131,1744,1745],{"class":1133,"line":1152},[1131,1746,1161],{},[1080,1748,1749],{},"Running this line many times would show a bonus token roughly 15 times out of every 100 — a real way to simulate a randomly-occurring event for testing.",[1114,1751,1753],{"id":1752},"recap","Recap",[1344,1755,1756,1758,1762,1764],{},[1347,1757,1397],{},[1347,1759,1400,1760,1403],{},[1090,1761,1177],{},[1347,1763,1406],{},[1347,1765,1766,1411,1768,1414],{},[1090,1767,1311],{},[1090,1769,1080],{},[1427,1771,1429],{},{"title":1127,"searchDepth":1140,"depth":1140,"links":1773},[1774,1775,1776,1777,1778,1779,1780],{"id":1454,"depth":1140,"text":1455},{"id":1464,"depth":1140,"text":1465},{"id":1510,"depth":1140,"text":1511},{"id":1568,"depth":1140,"text":1569},{"id":1639,"depth":1140,"text":1640},{"id":1704,"depth":1140,"text":1705},{"id":1752,"depth":1140,"text":1753},{"outlineRef":1440,"pairsWith":1782,"status":1783},"[`lessons\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms.md`](..\u002F..\u002Flessons\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms.md)","new — authored worked example (fully solved, walked step by step — not a problem to attempt)",{"title":547,"description":1127},"HjYPCGN8ra477zTeju3msVOrn-6w-VM2wxojJCGzvkM",{"id":1787,"title":856,"body":1788,"description":1127,"extension":1438,"meta":2566,"navigation":1442,"path":855,"seo":2568,"stem":857,"__hash__":2569},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.9-implementing-selection-and-iteration-algorithms.md",{"type":1073,"value":1789,"toc":2561},[1790,1793,1797,1803,1826,1833,1838,1873,1879,1888,1920,1924,1933,1969,1972,2028,2033,2124,2191,2195,2201,2235,2238,2269,2277,2282,2318,2323,2438,2443,2518,2559],[1076,1791,856],{"id":1792},"implementing-selection-and-iteration-algorithms-exercises",[1114,1794,1796],{"id":1795},"multiple-choice","Multiple Choice",[1080,1798,1799,1802],{},[1350,1800,1801],{},"Question:"," A teammate wants a warning to print roughly 25% of the time a sensor is read, and writes:",[1122,1804,1806],{"className":1124,"code":1805,"language":1126,"meta":1127,"style":1127},"if (Math.random() \u003C 0.25)\n{\n    System.out.println(\"Sensor glitch simulated\");\n}\n",[1090,1807,1808,1813,1817,1822],{"__ignoreMap":1127},[1131,1809,1810],{"class":1133,"line":1134},[1131,1811,1812],{},"if (Math.random() \u003C 0.25)\n",[1131,1814,1815],{"class":1133,"line":1140},[1131,1816,1149],{},[1131,1818,1819],{"class":1133,"line":1146},[1131,1820,1821],{},"    System.out.println(\"Sensor glitch simulated\");\n",[1131,1823,1824],{"class":1133,"line":1152},[1131,1825,1161],{},[1080,1827,1828,1829,1832],{},"They run this exact code 4 times in a row and are confused that ",[1090,1830,1831],{},"\"Sensor glitch simulated\""," printed 0 times, not exactly once. What's the best explanation?",[1080,1834,1835],{},[1350,1836,1837],{},"Options:",[1344,1839,1840,1850,1860,1867],{},[1347,1841,1842,1843,1846,1847],{},"A. The code has a bug — ",[1090,1844,1845],{},"\u003C 0.25"," should be ",[1090,1848,1849],{},"== 0.25",[1347,1851,1852,1853,1855,1856,1859],{},"B. ",[1090,1854,1710],{}," only returns values above ",[1090,1857,1858],{},"0.5",", so this condition can never trigger",[1347,1861,1862,1863,1866],{},"C. ",[1090,1864,1865],{},"0.25"," is a probability, not a guaranteed count — over just 4 tries, it's entirely normal for the event to not happen even once",[1347,1868,1869,1870,1872],{},"D. ",[1090,1871,1710],{}," must be seeded first, or it always returns the same value",[1080,1874,1875,1878],{},[1350,1876,1877],{},"Answer:"," C",[1080,1880,1881,1247,1884,1887],{},[1350,1882,1883],{},"Why:",[1090,1885,1886],{},"Math.random() \u003C 0.25"," is true with probability 25% on any single call — it doesn't guarantee \"1 out of every 4 tries.\" Over only 4 tries, getting zero matches (or two, or more) is completely normal; the 25% figure only describes the average over many, many tries, not a fixed count in a small sample.",[1344,1889,1890,1902,1914],{},[1347,1891,1892,1893,1895,1896,1898,1899,1901],{},"A is wrong because ",[1090,1894,1849],{}," would almost never be true — ",[1090,1897,1710],{}," returns values across an essentially continuous range, so ",[1090,1900,1845],{}," is exactly the right way to express a 25% chance.",[1347,1903,1904,1905,1711,1907,1715,1909,1911,1912,1414],{},"B is wrong because ",[1090,1906,1710],{},[1090,1908,1714],{},[1090,1910,1718],{},", spread evenly across that entire range — not restricted to values above ",[1090,1913,1858],{},[1347,1915,1916,1917,1919],{},"D is wrong because ",[1090,1918,1710],{}," works correctly for this kind of simulation without any manual seeding step; it doesn't return the same fixed value on repeated calls.",[1114,1921,1923],{"id":1922},"micro-parsons","Micro-Parsons",[1080,1925,1926,1929,1930,1932],{},[1350,1927,1928],{},"Problem:"," Given this class and main method, reorder the fragments below into the method body that uses a ",[1090,1931,1100],{}," loop counting from 1 to 6 to count how many of those numbers are divisible by 3, then prints the count.",[1122,1934,1936],{"className":1124,"code":1935,"language":1126,"meta":1127,"style":1127},"public class MultipleCounter\n{\n    public static void main(String[] args)\n    {\n        \u002F\u002F your reordered fragments go here\n    }\n}\n",[1090,1937,1938,1943,1947,1952,1956,1961,1965],{"__ignoreMap":1127},[1131,1939,1940],{"class":1133,"line":1134},[1131,1941,1942],{},"public class MultipleCounter\n",[1131,1944,1945],{"class":1133,"line":1140},[1131,1946,1149],{},[1131,1948,1949],{"class":1133,"line":1146},[1131,1950,1951],{},"    public static void main(String[] args)\n",[1131,1953,1954],{"class":1133,"line":1152},[1131,1955,1206],{},[1131,1957,1958],{"class":1133,"line":1158},[1131,1959,1960],{},"        \u002F\u002F your reordered fragments go here\n",[1131,1962,1963],{"class":1133,"line":1164},[1131,1964,1217],{},[1131,1966,1967],{"class":1133,"line":1214},[1131,1968,1161],{},[1080,1970,1971],{},"Reorder the fragments below to complete it:",[1344,1973,1974,1980,1986,1992,1998,2004,2010,2016,2022],{},[1347,1975,1976,1977],{},"a. ",[1090,1978,1979],{},"            if (n % 3 == 0)",[1347,1981,1982,1983],{},"b. ",[1090,1984,1985],{},"        System.out.println(multipleCount);",[1347,1987,1988,1989],{},"c. ",[1090,1990,1991],{},"        int multipleCount = 0;",[1347,1993,1994,1995],{},"d. ",[1090,1996,1997],{},"            }",[1347,1999,2000,2001],{},"e. ",[1090,2002,2003],{},"                multipleCount++;",[1347,2005,2006,2007],{},"f. ",[1090,2008,2009],{},"        for (int n = 1; n \u003C= 6; n++)",[1347,2011,2012,2013],{},"g. ",[1090,2014,2015],{},"        }",[1347,2017,2018,2019],{},"h. ",[1090,2020,2021],{},"            {",[1347,2023,2024,2025],{},"i. ",[1090,2026,2027],{},"        {",[1080,2029,2030,2032],{},[1350,2031,1877],{}," c, f, i, a, h, e, d, g, b",[1122,2034,2036],{"className":1124,"code":2035,"language":1126,"meta":1127,"style":1127},"public class MultipleCounter\n{\n    public static void main(String[] args)\n    {\n        int multipleCount = 0;\n\n        for (int n = 1; n \u003C= 6; n++)\n        {\n            if (n % 3 == 0)\n            {\n                multipleCount++;\n            }\n        }\n\n        System.out.println(multipleCount);\n    }\n}\n",[1090,2037,2038,2042,2046,2050,2054,2059,2064,2069,2074,2079,2085,2091,2097,2103,2108,2114,2119],{"__ignoreMap":1127},[1131,2039,2040],{"class":1133,"line":1134},[1131,2041,1942],{},[1131,2043,2044],{"class":1133,"line":1140},[1131,2045,1149],{},[1131,2047,2048],{"class":1133,"line":1146},[1131,2049,1951],{},[1131,2051,2052],{"class":1133,"line":1152},[1131,2053,1206],{},[1131,2055,2056],{"class":1133,"line":1158},[1131,2057,2058],{},"        int multipleCount = 0;\n",[1131,2060,2061],{"class":1133,"line":1164},[1131,2062,2063],{"emptyLinePlaceholder":1442},"\n",[1131,2065,2066],{"class":1133,"line":1214},[1131,2067,2068],{},"        for (int n = 1; n \u003C= 6; n++)\n",[1131,2070,2071],{"class":1133,"line":1220},[1131,2072,2073],{},"        {\n",[1131,2075,2076],{"class":1133,"line":1618},[1131,2077,2078],{},"            if (n % 3 == 0)\n",[1131,2080,2082],{"class":1133,"line":2081},10,[1131,2083,2084],{},"            {\n",[1131,2086,2088],{"class":1133,"line":2087},11,[1131,2089,2090],{},"                multipleCount++;\n",[1131,2092,2094],{"class":1133,"line":2093},12,[1131,2095,2096],{},"            }\n",[1131,2098,2100],{"class":1133,"line":2099},13,[1131,2101,2102],{},"        }\n",[1131,2104,2106],{"class":1133,"line":2105},14,[1131,2107,2063],{"emptyLinePlaceholder":1442},[1131,2109,2111],{"class":1133,"line":2110},15,[1131,2112,2113],{},"        System.out.println(multipleCount);\n",[1131,2115,2117],{"class":1133,"line":2116},16,[1131,2118,1217],{},[1131,2120,2122],{"class":1133,"line":2121},17,[1131,2123,1161],{},[1080,2125,2126,1247,2129,2132,2133,2136,2137,2139,2140,2142,2143,2146,2147,2149,2150,2132,2152,2155,2156,2159,2160,2163,2164,1698,2166,2168,2169,2171,2172,2175,2176,2179,2180,2183,2184,2187,2188,2190],{},[1350,2127,2128],{},"Why this order:",[1090,2130,2131],{},"multipleCount"," (",[1090,2134,2135],{},"c",") — the accumulator — has to start at ",[1090,2138,1356],{}," before the loop begins. The ",[1090,2141,1100],{}," header (",[1090,2144,2145],{},"f",") and its opening brace (",[1090,2148,1486],{},") come next. Inside, the ",[1090,2151,1177],{},[1090,2153,2154],{},"a",") and its brace (",[1090,2157,2158],{},"h",") check each number; the increment (",[1090,2161,2162],{},"e",") is what makes this a frequency count, and it has to live ",[1086,2165,1387],{},[1090,2167,1177],{},", not directly in the loop body, or it would count every number instead of just the matching ones. The braces close in reverse order — the ",[1090,2170,1177],{},"'s body (",[1090,2173,2174],{},"d","), then the loop's body (",[1090,2177,2178],{},"g",") — and the final count prints (",[1090,2181,2182],{},"b",") only after the loop has finished. The surrounding class and ",[1090,2185,2186],{},"main"," method are the given scaffold; only the loop and its ",[1090,2189,1177],{}," needed reordering.",[1114,2192,2194],{"id":2193},"coding","Coding",[1080,2196,2197,2200],{},[1350,2198,2199],{},"Mode:"," harness",[1080,2202,2203,2205,2206,2209,2210,2213,2214,2217,2218,2221,2222,2225,2226,2229,2230,2232,2233,1414],{},[1350,2204,1928],{}," A gyro test model says the drift error at second ",[1090,2207,2208],{},"t"," is ",[1090,2211,2212],{},"t * t - 6 * t",", measured for every\nsecond from ",[1090,2215,2216],{},"1"," up to and including ",[1090,2219,2220],{},"seconds",". Drift can be negative. Write ",[1090,2223,2224],{},"highestDrift",", which returns\nthe ",[1350,2227,2228],{},"largest"," drift reading over those seconds. ",[1090,2231,2220],{}," is at least ",[1090,2234,2216],{},[1080,2236,2237],{},"Examples:",[1344,2239,2240,2254,2261],{},[1347,2241,2242,2245,2246,2249,2250,2253],{},[1090,2243,2244],{},"highestDrift(8)"," returns ",[1090,2247,2248],{},"16"," (the readings are ",[1090,2251,2252],{},"-5, -8, -9, -8, -5, 0, 7, 16",")",[1347,2255,2256,2245,2259],{},[1090,2257,2258],{},"highestDrift(6)",[1090,2260,1356],{},[1347,2262,2263,2245,2266],{},[1090,2264,2265],{},"highestDrift(7)",[1090,2267,2268],{},"7",[1080,2270,2271,1247,2274],{},[1350,2272,2273],{},"Signature:",[1090,2275,2276],{},"public static int highestDrift(int seconds)",[1080,2278,2279],{},[1350,2280,2281],{},"Starter:",[1122,2283,2285],{"className":1124,"code":2284,"language":1126,"meta":1127,"style":1127},"public class Solution\n{\n    public static int highestDrift(int seconds)\n    {\n        \u002F\u002F TODO: track the largest reading seen so far while looping\n    }\n}\n",[1090,2286,2287,2292,2296,2301,2305,2310,2314],{"__ignoreMap":1127},[1131,2288,2289],{"class":1133,"line":1134},[1131,2290,2291],{},"public class Solution\n",[1131,2293,2294],{"class":1133,"line":1140},[1131,2295,1149],{},[1131,2297,2298],{"class":1133,"line":1146},[1131,2299,2300],{},"    public static int highestDrift(int seconds)\n",[1131,2302,2303],{"class":1133,"line":1152},[1131,2304,1206],{},[1131,2306,2307],{"class":1133,"line":1158},[1131,2308,2309],{},"        \u002F\u002F TODO: track the largest reading seen so far while looping\n",[1131,2311,2312],{"class":1133,"line":1164},[1131,2313,1217],{},[1131,2315,2316],{"class":1133,"line":1214},[1131,2317,1161],{},[1080,2319,2320],{},[1350,2321,2322],{},"Tests:",[2324,2325,2326,2342],"table",{},[2327,2328,2329],"thead",{},[2330,2331,2332,2336,2339],"tr",{},[2333,2334,2335],"th",{},"Visible",[2333,2337,2338],{},"Arguments",[2333,2340,2341],{},"Expected",[2343,2344,2345,2360,2373,2385,2399,2412,2425],"tbody",{},[2330,2346,2347,2351,2356],{},[2348,2349,2350],"td",{},"yes",[2348,2352,2353],{},[1090,2354,2355],{},"8",[2348,2357,2358],{},[1090,2359,2248],{},[2330,2361,2362,2364,2369],{},[2348,2363,2350],{},[2348,2365,2366],{},[1090,2367,2368],{},"6",[2348,2370,2371],{},[1090,2372,1356],{},[2330,2374,2375,2377,2381],{},[2348,2376,2350],{},[2348,2378,2379],{},[1090,2380,2268],{},[2348,2382,2383],{},[1090,2384,2268],{},[2330,2386,2387,2390,2394],{},[2348,2388,2389],{},"no",[2348,2391,2392],{},[1090,2393,2216],{},[2348,2395,2396],{},[1090,2397,2398],{},"-5",[2330,2400,2401,2403,2408],{},[2348,2402,2389],{},[2348,2404,2405],{},[1090,2406,2407],{},"3",[2348,2409,2410],{},[1090,2411,2398],{},[2330,2413,2414,2416,2421],{},[2348,2415,2389],{},[2348,2417,2418],{},[1090,2419,2420],{},"4",[2348,2422,2423],{},[1090,2424,2398],{},[2330,2426,2427,2429,2434],{},[2348,2428,2389],{},[2348,2430,2431],{},[1090,2432,2433],{},"5",[2348,2435,2436],{},[1090,2437,2398],{},[1080,2439,2440],{},[1350,2441,2442],{},"Solution:",[1122,2444,2446],{"className":1124,"code":2445,"language":1126,"meta":1127,"style":1127},"public class Solution\n{\n    public static int highestDrift(int seconds)\n    {\n        int highest = Integer.MIN_VALUE;\n        for (int t = 1; t \u003C= seconds; t++)\n        {\n            int drift = t * t - 6 * t;\n            if (drift > highest)\n            {\n                highest = drift;\n            }\n        }\n        return highest;\n    }\n}\n",[1090,2447,2448,2452,2456,2460,2464,2469,2474,2478,2483,2488,2492,2497,2501,2505,2510,2514],{"__ignoreMap":1127},[1131,2449,2450],{"class":1133,"line":1134},[1131,2451,2291],{},[1131,2453,2454],{"class":1133,"line":1140},[1131,2455,1149],{},[1131,2457,2458],{"class":1133,"line":1146},[1131,2459,2300],{},[1131,2461,2462],{"class":1133,"line":1152},[1131,2463,1206],{},[1131,2465,2466],{"class":1133,"line":1158},[1131,2467,2468],{},"        int highest = Integer.MIN_VALUE;\n",[1131,2470,2471],{"class":1133,"line":1164},[1131,2472,2473],{},"        for (int t = 1; t \u003C= seconds; t++)\n",[1131,2475,2476],{"class":1133,"line":1214},[1131,2477,2073],{},[1131,2479,2480],{"class":1133,"line":1220},[1131,2481,2482],{},"            int drift = t * t - 6 * t;\n",[1131,2484,2485],{"class":1133,"line":1618},[1131,2486,2487],{},"            if (drift > highest)\n",[1131,2489,2490],{"class":1133,"line":2081},[1131,2491,2084],{},[1131,2493,2494],{"class":1133,"line":2087},[1131,2495,2496],{},"                highest = drift;\n",[1131,2498,2499],{"class":1133,"line":2093},[1131,2500,2096],{},[1131,2502,2503],{"class":1133,"line":2099},[1131,2504,2102],{},[1131,2506,2507],{"class":1133,"line":2105},[1131,2508,2509],{},"        return highest;\n",[1131,2511,2512],{"class":1133,"line":2110},[1131,2513,1217],{},[1131,2515,2516],{"class":1133,"line":2116},[1131,2517,1161],{},[1080,2519,2520,2522,2523,2526,2527,2529,2530,1633,2532,2534,2535,2537,2538,2540,2541,2543,2544,2546,2547,2549,2550,2552,2553,2555,2556,2558],{},[1350,2521,1883],{}," This is the lesson's min\u002Fmax pattern: an accumulator (",[1090,2524,2525],{},"highest",") plus an ",[1090,2528,1177],{}," inside the loop\nthat replaces it whenever a bigger reading turns up. The seed matters. Starting ",[1090,2531,2525],{},[1090,2533,1356],{}," is the\nlesson's wrong-starting-value pitfall: when every reading is negative (",[1090,2536,2220],{}," from ",[1090,2539,2216],{}," to ",[1090,2542,2433],{},"), ",[1090,2545,1356],{},"\nbeats all of them and the method wrongly returns ",[1090,2548,1356],{},". ",[1090,2551,1365],{},", the most negative ",[1090,2554,1369],{},", loses to\nevery real reading, so the first one always replaces it. Seeding with the first reading (",[1090,2557,2398],{},") would also\nwork.",[1427,2560,1429],{},{"title":1127,"searchDepth":1140,"depth":1140,"links":2562},[2563,2564,2565],{"id":1795,"depth":1140,"text":1796},{"id":1922,"depth":1140,"text":1923},{"id":2193,"depth":1140,"text":2194},{"outlineRef":1440,"pairsWith":1782,"status":2567},"new — authored exercises (Multiple Choice + Micro-Parsons + Coding)",{"title":856,"description":1127},"sTBS3dPG4TxUn40lnMWkt2DL7PtxM9Zhd9oz0AW1qaI",1792718164820]