[{"data":1,"prerenderedAt":2672},["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.8":1070,"item-example-full-ch05-control-structures-5.8":1559,"item-exercise-full-ch05-control-structures-5.8":1914},[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":106,"body":1072,"description":1104,"extension":1552,"meta":1553,"navigation":1556,"path":105,"seo":1557,"stem":107,"__hash__":1558},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops.md",{"type":1073,"value":1074,"toc":1542},"minimark",[1075,1079,1084,1098,1145,1155,1159,1162,1190,1193,1202,1214,1247,1254,1258,1268,1299,1312,1316,1327,1394,1417,1421,1483,1487,1527,1538],[1076,1077,106],"h1",{"id":1078},"while-loops",[1080,1081,1083],"h2",{"id":1082},"the-three-steps-of-a-loop","The Three Steps of a Loop",[1085,1086,1087,1088,1092,1093,1097],"p",{},"A ",[1089,1090,1091],"code",{},"while"," loop repeats its body as long as a condition holds, checked ",[1094,1095,1096],"em",{},"before"," every pass, including the first:",[1099,1100,1105],"pre",{"className":1101,"code":1102,"language":1103,"meta":1104,"style":1104},"language-java shiki shiki-themes github-light github-dark","int attempts = 0;             \u002F\u002F 1. initialize\nwhile (attempts \u003C 3 && !connected) \u002F\u002F 2. test\n{\n    connected = tryConnect();\n    attempts++;                \u002F\u002F 3. update\n}\n","java","",[1089,1106,1107,1115,1121,1127,1133,1139],{"__ignoreMap":1104},[1108,1109,1112],"span",{"class":1110,"line":1111},"line",1,[1108,1113,1114],{},"int attempts = 0;             \u002F\u002F 1. initialize\n",[1108,1116,1118],{"class":1110,"line":1117},2,[1108,1119,1120],{},"while (attempts \u003C 3 && !connected) \u002F\u002F 2. test\n",[1108,1122,1124],{"class":1110,"line":1123},3,[1108,1125,1126],{},"{\n",[1108,1128,1130],{"class":1110,"line":1129},4,[1108,1131,1132],{},"    connected = tryConnect();\n",[1108,1134,1136],{"class":1110,"line":1135},5,[1108,1137,1138],{},"    attempts++;                \u002F\u002F 3. update\n",[1108,1140,1142],{"class":1110,"line":1141},6,[1108,1143,1144],{},"}\n",[1085,1146,1147,1148,1151,1152,1154],{},"Every loop needs these same three steps — initialize the loop variable, test it, update it inside the loop. A ",[1089,1149,1150],{},"for"," loop (Lesson 5.1-5.2) just packs all three into one header line; a ",[1089,1153,1091],{}," loop spreads them out, which is more natural when the \"update\" isn't a simple counter.",[1080,1156,1158],{"id":1157},"infinite-loops","Infinite Loops",[1085,1160,1161],{},"Forget step 3 and the condition never changes — the loop runs forever:",[1099,1163,1165],{"className":1101,"code":1164,"language":1103,"meta":1104,"style":1104},"int i = 0;\nwhile (i \u003C 10)\n{\n    System.out.println(i); \u002F\u002F i never changes — this never stops\n}\n",[1089,1166,1167,1172,1177,1181,1186],{"__ignoreMap":1104},[1108,1168,1169],{"class":1110,"line":1111},[1108,1170,1171],{},"int i = 0;\n",[1108,1173,1174],{"class":1110,"line":1117},[1108,1175,1176],{},"while (i \u003C 10)\n",[1108,1178,1179],{"class":1110,"line":1123},[1108,1180,1126],{},[1108,1182,1183],{"class":1110,"line":1129},[1108,1184,1185],{},"    System.out.println(i); \u002F\u002F i never changes — this never stops\n",[1108,1187,1188],{"class":1110,"line":1135},[1108,1189,1144],{},[1085,1191,1192],{},"An infinite loop on a robot doesn't just print forever — it can freeze the whole robot's control loop, since nothing after it ever gets a chance to run.",[1080,1194,1196,1197,1199,1200],{"id":1195},"when-to-reach-for-while-instead-of-for","When to Reach for ",[1089,1198,1091],{}," Instead of ",[1089,1201,1150],{},[1085,1203,1204,1206,1207,1209,1210,1213],{},[1089,1205,1150],{}," fits naturally when you already know the number of iterations. ",[1089,1208,1091],{}," fits better when you're repeating until a ",[1094,1211,1212],{},"condition"," changes, not counting to a number — like retrying a connection a limited number of times:",[1099,1215,1217],{"className":1101,"code":1216,"language":1103,"meta":1104,"style":1104},"int attempts = 0;\nwhile (!gyro.isConnected() && attempts \u003C 5)\n{\n    gyro.reconnect(); \u002F\u002F assume our gyro class has this retry method\n    attempts++;\n}\n",[1089,1218,1219,1224,1229,1233,1238,1243],{"__ignoreMap":1104},[1108,1220,1221],{"class":1110,"line":1111},[1108,1222,1223],{},"int attempts = 0;\n",[1108,1225,1226],{"class":1110,"line":1117},[1108,1227,1228],{},"while (!gyro.isConnected() && attempts \u003C 5)\n",[1108,1230,1231],{"class":1110,"line":1123},[1108,1232,1126],{},[1108,1234,1235],{"class":1110,"line":1129},[1108,1236,1237],{},"    gyro.reconnect(); \u002F\u002F assume our gyro class has this retry method\n",[1108,1239,1240],{"class":1110,"line":1135},[1108,1241,1242],{},"    attempts++;\n",[1108,1244,1245],{"class":1110,"line":1141},[1108,1246,1144],{},[1085,1248,1249,1250,1253],{},"This tries at most 5 times, then moves on whether or not the gyro came back. What it must never do is ",[1094,1251,1252],{},"wait",": robot code runs in short, repeating cycles many times per second, and a loop that sits spinning until a sensor finally responds holds up everything else — the freeze described above. In robot code, check a condition once per cycle instead of looping until it changes.",[1080,1255,1257],{"id":1256},"do-while-run-the-body-at-least-once","do-while: Run the Body at Least Once",[1085,1259,1087,1260,1263,1264,1267],{},[1089,1261,1262],{},"do-while"," loop checks its condition ",[1094,1265,1266],{},"after"," each pass instead of before, so the body always runs at least once:",[1099,1269,1271],{"className":1101,"code":1270,"language":1103,"meta":1104,"style":1104},"int attempts = 0;\ndo\n{\n    connected = tryConnect();\n    attempts++;\n} while (!connected && attempts \u003C 3); \u002F\u002F this semicolon is required\n",[1089,1272,1273,1277,1282,1286,1290,1294],{"__ignoreMap":1104},[1108,1274,1275],{"class":1110,"line":1111},[1108,1276,1223],{},[1108,1278,1279],{"class":1110,"line":1117},[1108,1280,1281],{},"do\n",[1108,1283,1284],{"class":1110,"line":1123},[1108,1285,1126],{},[1108,1287,1288],{"class":1110,"line":1129},[1108,1289,1132],{},[1108,1291,1292],{"class":1110,"line":1135},[1108,1293,1242],{},[1108,1295,1296],{"class":1110,"line":1141},[1108,1297,1298],{},"} while (!connected && attempts \u003C 3); \u002F\u002F this semicolon is required\n",[1085,1300,1301,1302,1305,1306,1308,1309,1311],{},"This is the first loop in this lesson, reshaped: the first connection attempt happens unconditionally, and the test only decides whether to try ",[1094,1303,1304],{},"again",". Use ",[1089,1307,1262],{}," when there's nothing to test until the body has run once; otherwise, a plain ",[1089,1310,1091],{}," is the usual choice.",[1080,1313,1315],{"id":1314},"leaving-a-loop-early-break-and-continue","Leaving a Loop Early: break and continue",[1085,1317,1318,1319,1322,1323,1326],{},"Two statements change a loop's flow from inside its body. ",[1089,1320,1321],{},"break"," ends the loop immediately; ",[1089,1324,1325],{},"continue"," skips the rest of the current pass and moves on to the next one:",[1099,1328,1330],{"className":1101,"code":1329,"language":1103,"meta":1104,"style":1104},"for (int port = 0; port \u003C 10; port++)\n{\n    if (port == 3)\n    {\n        continue; \u002F\u002F port 3 is reserved: skip to the next pass\n    }\n    if (isFree(port))\n    {\n        System.out.println(\"First free port: \" + port);\n        break;    \u002F\u002F found one: stop the whole loop now\n    }\n}\n",[1089,1331,1332,1337,1341,1346,1351,1356,1361,1367,1372,1378,1384,1389],{"__ignoreMap":1104},[1108,1333,1334],{"class":1110,"line":1111},[1108,1335,1336],{},"for (int port = 0; port \u003C 10; port++)\n",[1108,1338,1339],{"class":1110,"line":1117},[1108,1340,1126],{},[1108,1342,1343],{"class":1110,"line":1123},[1108,1344,1345],{},"    if (port == 3)\n",[1108,1347,1348],{"class":1110,"line":1129},[1108,1349,1350],{},"    {\n",[1108,1352,1353],{"class":1110,"line":1135},[1108,1354,1355],{},"        continue; \u002F\u002F port 3 is reserved: skip to the next pass\n",[1108,1357,1358],{"class":1110,"line":1141},[1108,1359,1360],{},"    }\n",[1108,1362,1364],{"class":1110,"line":1363},7,[1108,1365,1366],{},"    if (isFree(port))\n",[1108,1368,1370],{"class":1110,"line":1369},8,[1108,1371,1350],{},[1108,1373,1375],{"class":1110,"line":1374},9,[1108,1376,1377],{},"        System.out.println(\"First free port: \" + port);\n",[1108,1379,1381],{"class":1110,"line":1380},10,[1108,1382,1383],{},"        break;    \u002F\u002F found one: stop the whole loop now\n",[1108,1385,1387],{"class":1110,"line":1386},11,[1108,1388,1360],{},[1108,1390,1392],{"class":1110,"line":1391},12,[1108,1393,1144],{},[1085,1395,1396,1397,1399,1400,1402,1403,1406,1407,1409,1410,1412,1413,1416],{},"In a ",[1089,1398,1150],{}," loop, ",[1089,1401,1325],{}," still runs the update (",[1089,1404,1405],{},"port++",") before the next test; in a ",[1089,1408,1091],{}," loop, it jumps straight to the test. Inside nested loops, both affect only the innermost loop they're in. (",[1089,1411,1321],{}," also ends a case in a ",[1089,1414,1415],{},"switch"," statement — Lesson 5.12.)",[1080,1418,1420],{"id":1419},"common-pitfalls","Common Pitfalls",[1422,1423,1424,1435,1441,1465],"ul",{},[1425,1426,1427,1431,1432,1434],"li",{},[1428,1429,1430],"strong",{},"Forgetting to update the loop variable."," The single most common cause of an infinite loop — every ",[1089,1433,1091],{}," loop needs something inside it that eventually makes the condition false.",[1425,1436,1437,1440],{},[1428,1438,1439],{},"A condition that's false from the very first check."," If the condition never holds, the loop body never runs at all — not even once. Double-check the loop variable's starting value against the condition.",[1425,1442,1443,1449,1450,1453,1454,1457,1458,1460,1461,1464],{},[1428,1444,1445,1446,1448],{},"Leaving off the semicolon after a ",[1089,1447,1262],{},"'s condition."," ",[1089,1451,1452],{},"} while (attempts \u003C 3)"," with no ",[1089,1455,1456],{},";"," won't compile. The opposite mistake, a stray ",[1089,1459,1456],{}," right after a plain ",[1089,1462,1463],{},"while (...)"," header, gives the loop an empty body — and an infinite loop if the condition starts true.",[1425,1466,1467,1475,1476,1479,1480,1482],{},[1428,1468,1087,1469,1471,1472,1474],{},[1089,1470,1325],{}," in a ",[1089,1473,1091],{}," loop that skips the update."," If the update (",[1089,1477,1478],{},"i++",") comes after the ",[1089,1481,1325],{},", the skipped pass never reaches it, and the loop repeats the same value forever.",[1080,1484,1486],{"id":1485},"key-takeaways","Key Takeaways",[1422,1488,1489,1498,1503,1506,1511,1519],{},[1425,1490,1491,1492,1494,1495,1497],{},"Every loop needs three steps: initialize, test, update — ",[1089,1493,1091],{}," just doesn't bundle them into one line like ",[1089,1496,1150],{}," does.",[1425,1499,1087,1500,1502],{},[1089,1501,1091],{}," loop's condition is checked before every pass, including the first — if it starts false, the body never runs.",[1425,1504,1505],{},"Forgetting to update the loop variable is the classic cause of an infinite loop, which can freeze a robot's control code.",[1425,1507,1508,1510],{},[1089,1509,1091],{}," fits naturally when you're repeating until a condition changes rather than counting a known number of iterations.",[1425,1512,1087,1513,1515,1516,1518],{},[1089,1514,1262],{}," checks its condition after each pass, so its body always runs at least once — and its closing ",[1089,1517,1463],{}," needs a semicolon.",[1425,1520,1521,1523,1524,1526],{},[1089,1522,1321],{}," ends the innermost loop immediately; ",[1089,1525,1325],{}," skips to that loop's next pass.",[1085,1528,1529,1530,1533,1534,1537],{},"Derived from ",[1089,1531,1532],{},"csawesome-2026",": ",[1089,1535,1536],{},"unit-2-selection-and-iteration\u002F2.07-while-loops.md"," (CSA 2.7)",[1539,1540,1541],"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":1104,"searchDepth":1117,"depth":1117,"links":1543},[1544,1545,1546,1548,1549,1550,1551],{"id":1082,"depth":1117,"text":1083},{"id":1157,"depth":1117,"text":1158},{"id":1195,"depth":1117,"text":1547},"When to Reach for while Instead of for",{"id":1256,"depth":1117,"text":1257},{"id":1314,"depth":1117,"text":1315},{"id":1419,"depth":1117,"text":1420},{"id":1485,"depth":1117,"text":1486},"md",{"outlineRef":1554,"status":1555},"5.8 — While Loops (CSA 2.7)","new — authored lesson (fuller depth than the teaser slide)",true,{"title":106,"description":1104},"AaW0N0Efpur_KSKl4OmoYb0yB1-i0l6Q6-5yIkTgCQ8",{"id":1560,"title":543,"body":1561,"description":1104,"extension":1552,"meta":1909,"navigation":1556,"path":542,"seo":1912,"stem":544,"__hash__":1913},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.8-while-loops.md",{"type":1073,"value":1562,"toc":1899},[1563,1566,1570,1577,1584,1595,1599,1611,1653,1657,1702,1706,1711,1806,1816,1820,1823,1849,1875,1879,1897],[1076,1564,543],{"id":1565},"while-loops-worked-example",[1080,1567,1569],{"id":1568},"problem","Problem",[1085,1571,1572,1573,1576],{},"Before autonomous starts, the elevator needs to reach its zeroed (home) height. Simulate waiting for it: starting at a known height, keep lowering it one step at a time until it reaches ",[1089,1574,1575],{},"0",", or until 5 attempts have passed — printing each attempt.",[1080,1578,1580,1581,1583],{"id":1579},"step-1-identify-why-for-doesnt-fit-well-here","Step 1: Identify Why ",[1089,1582,1150],{}," Doesn't Fit Well Here",[1085,1585,1087,1586,1588,1589,1591,1592,1594],{},[1089,1587,1150],{}," loop fits naturally when the number of iterations is already known up front. Here, the number of steps needed depends on where the elevator starts — this is waiting for a ",[1094,1590,1212],{},", which is exactly when ",[1089,1593,1091],{}," fits better.",[1080,1596,1598],{"id":1597},"step-2-lay-out-the-three-steps","Step 2: Lay Out the Three Steps",[1085,1600,1601,1602,1604,1605,1607,1608,1610],{},"Every loop — ",[1089,1603,1150],{}," or ",[1089,1606,1091],{}," — needs the same three ingredients: initialize, test, update. A ",[1089,1609,1091],{}," just spreads them across separate lines instead of packing them into one header. This loop's test checks two things, so both variables get initialized and both get updated:",[1099,1612,1614],{"className":1101,"code":1613,"language":1103,"meta":1104,"style":1104},"double elevatorHeight = 3.0;  \u002F\u002F 1. initialize\nint attempts = 0;\n\nwhile (elevatorHeight > 0.0 && attempts \u003C 5)  \u002F\u002F 2. test\n{\n    elevatorHeight -= 1.0;                     \u002F\u002F 3. update (moves toward the goal)\n    attempts++;                                \u002F\u002F 3. update (counts toward the cap)\n}\n",[1089,1615,1616,1621,1625,1630,1635,1639,1644,1649],{"__ignoreMap":1104},[1108,1617,1618],{"class":1110,"line":1111},[1108,1619,1620],{},"double elevatorHeight = 3.0;  \u002F\u002F 1. initialize\n",[1108,1622,1623],{"class":1110,"line":1117},[1108,1624,1223],{},[1108,1626,1627],{"class":1110,"line":1123},[1108,1628,1629],{"emptyLinePlaceholder":1556},"\n",[1108,1631,1632],{"class":1110,"line":1129},[1108,1633,1634],{},"while (elevatorHeight > 0.0 && attempts \u003C 5)  \u002F\u002F 2. test\n",[1108,1636,1637],{"class":1110,"line":1135},[1108,1638,1126],{},[1108,1640,1641],{"class":1110,"line":1141},[1108,1642,1643],{},"    elevatorHeight -= 1.0;                     \u002F\u002F 3. update (moves toward the goal)\n",[1108,1645,1646],{"class":1110,"line":1363},[1108,1647,1648],{},"    attempts++;                                \u002F\u002F 3. update (counts toward the cap)\n",[1108,1650,1651],{"class":1110,"line":1369},[1108,1652,1144],{},[1080,1654,1656],{"id":1655},"step-3-add-the-print-inside-the-loop","Step 3: Add the Print Inside the Loop",[1099,1658,1660],{"className":1101,"code":1659,"language":1103,"meta":1104,"style":1104},"double elevatorHeight = 3.0;\nint attempts = 0;\n\nwhile (elevatorHeight > 0.0 && attempts \u003C 5)\n{\n    elevatorHeight -= 1.0;\n    attempts++;\n    System.out.println(\"Attempt \" + attempts + \": height = \" + elevatorHeight);\n}\n",[1089,1661,1662,1667,1671,1675,1680,1684,1689,1693,1698],{"__ignoreMap":1104},[1108,1663,1664],{"class":1110,"line":1111},[1108,1665,1666],{},"double elevatorHeight = 3.0;\n",[1108,1668,1669],{"class":1110,"line":1117},[1108,1670,1223],{},[1108,1672,1673],{"class":1110,"line":1123},[1108,1674,1629],{"emptyLinePlaceholder":1556},[1108,1676,1677],{"class":1110,"line":1129},[1108,1678,1679],{},"while (elevatorHeight > 0.0 && attempts \u003C 5)\n",[1108,1681,1682],{"class":1110,"line":1135},[1108,1683,1126],{},[1108,1685,1686],{"class":1110,"line":1141},[1108,1687,1688],{},"    elevatorHeight -= 1.0;\n",[1108,1690,1691],{"class":1110,"line":1363},[1108,1692,1242],{},[1108,1694,1695],{"class":1110,"line":1369},[1108,1696,1697],{},"    System.out.println(\"Attempt \" + attempts + \": height = \" + elevatorHeight);\n",[1108,1699,1700],{"class":1110,"line":1374},[1108,1701,1144],{},[1080,1703,1705],{"id":1704},"step-4-trace-it-by-hand","Step 4: Trace It by Hand",[1085,1707,1708,1709,1097],{},"The condition is checked ",[1094,1710,1096],{},[1712,1713,1714,1736],"table",{},[1715,1716,1717],"thead",{},[1718,1719,1720,1724,1730,1733],"tr",{},[1721,1722,1723],"th",{},"check",[1721,1725,1726,1729],{},[1089,1727,1728],{},"elevatorHeight > 0.0 && attempts \u003C 5","?",[1721,1731,1732],{},"body runs?",[1721,1734,1735],{},"printed",[1737,1738,1739,1758,1774,1790],"tbody",{},[1718,1740,1741,1747,1750,1753],{},[1742,1743,1744],"td",{},[1089,1745,1746],{},"elevatorHeight=3.0, attempts=0",[1742,1748,1749],{},"true",[1742,1751,1752],{},"yes",[1742,1754,1755],{},[1089,1756,1757],{},"Attempt 1: height = 2.0",[1718,1759,1760,1765,1767,1769],{},[1742,1761,1762],{},[1089,1763,1764],{},"elevatorHeight=2.0, attempts=1",[1742,1766,1749],{},[1742,1768,1752],{},[1742,1770,1771],{},[1089,1772,1773],{},"Attempt 2: height = 1.0",[1718,1775,1776,1781,1783,1785],{},[1742,1777,1778],{},[1089,1779,1780],{},"elevatorHeight=1.0, attempts=2",[1742,1782,1749],{},[1742,1784,1752],{},[1742,1786,1787],{},[1089,1788,1789],{},"Attempt 3: height = 0.0",[1718,1791,1792,1797,1800,1803],{},[1742,1793,1794],{},[1089,1795,1796],{},"elevatorHeight=0.0, attempts=3",[1742,1798,1799],{},"false",[1742,1801,1802],{},"no",[1742,1804,1805],{},"—",[1085,1807,1808,1809,1812,1813,1815],{},"The loop stops after 3 attempts because ",[1089,1810,1811],{},"elevatorHeight > 0.0"," became false — the 5-attempt cap never even came into play this time, but it's there in case the elevator gets stuck and never reaches ",[1089,1814,1575],{},".",[1080,1817,1819],{"id":1818},"step-5-what-forgetting-the-update-would-do","Step 5: What Forgetting the Update Would Do",[1085,1821,1822],{},"If Step 2's decrement line were left out —",[1099,1824,1826],{"className":1101,"code":1825,"language":1103,"meta":1104,"style":1104},"while (elevatorHeight > 0.0 && attempts \u003C 5)\n{\n    attempts++;\n    \u002F\u002F elevatorHeight -= 1.0;  missing!\n}\n",[1089,1827,1828,1832,1836,1840,1845],{"__ignoreMap":1104},[1108,1829,1830],{"class":1110,"line":1111},[1108,1831,1679],{},[1108,1833,1834],{"class":1110,"line":1117},[1108,1835,1126],{},[1108,1837,1838],{"class":1110,"line":1123},[1108,1839,1242],{},[1108,1841,1842],{"class":1110,"line":1129},[1108,1843,1844],{},"    \u002F\u002F elevatorHeight -= 1.0;  missing!\n",[1108,1846,1847],{"class":1110,"line":1135},[1108,1848,1144],{},[1085,1850,1851,1852,1855,1856,1859,1860,1863,1864,1867,1868,1871,1872,1874],{},"— ",[1089,1853,1854],{},"elevatorHeight"," would stay ",[1089,1857,1858],{},"3.0"," forever, but ",[1089,1861,1862],{},"attempts \u003C 5"," still eventually becomes false after 5 passes, so this particular loop would still stop — just after doing nothing useful. If the ",[1089,1865,1866],{},"attempts"," cap weren't there ",[1094,1869,1870],{},"and"," the height update were missing, the loop would never end at all, freezing anything that runs after it. This is exactly why a ",[1089,1873,1091],{}," loop needs something inside it, on every path, that eventually makes the condition false.",[1080,1876,1878],{"id":1877},"recap","Recap",[1422,1880,1881,1887,1891,1893],{},[1425,1882,1491,1883,1494,1885,1497],{},[1089,1884,1091],{},[1089,1886,1150],{},[1425,1888,1087,1889,1502],{},[1089,1890,1091],{},[1425,1892,1505],{},[1425,1894,1895,1510],{},[1089,1896,1091],{},[1539,1898,1541],{},{"title":1104,"searchDepth":1117,"depth":1117,"links":1900},[1901,1902,1904,1905,1906,1907,1908],{"id":1568,"depth":1117,"text":1569},{"id":1579,"depth":1117,"text":1903},"Step 1: Identify Why for Doesn't Fit Well Here",{"id":1597,"depth":1117,"text":1598},{"id":1655,"depth":1117,"text":1656},{"id":1704,"depth":1117,"text":1705},{"id":1818,"depth":1117,"text":1819},{"id":1877,"depth":1117,"text":1878},{"outlineRef":1554,"pairsWith":1910,"status":1911},"[`lessons\u002Fch05-control-structures\u002F5.8-while-loops.md`](..\u002F..\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops.md)","new — authored worked example (fully solved, walked step by step — not a problem to attempt)",{"title":543,"description":1104},"jHnUjreyBQxiiAsh8VkRPhY5ipWFx53QF7a2YWN0AoY",{"id":1915,"title":852,"body":1916,"description":1104,"extension":1552,"meta":2668,"navigation":1556,"path":851,"seo":2670,"stem":853,"__hash__":2671},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.8-while-loops.md",{"type":1073,"value":1917,"toc":2663},[1918,1921,1925,1930,1968,1971,1976,2005,2011,2037,2054,2058,2064,2100,2103,2153,2158,2164,2240,2311,2315,2321,2362,2365,2392,2400,2405,2441,2446,2554,2559,2621,2661],[1076,1919,852],{"id":1920},"while-loops-exercises",[1080,1922,1924],{"id":1923},"multiple-choice","Multiple Choice",[1085,1926,1927],{},[1428,1928,1929],{},"Question:",[1099,1931,1933],{"className":1101,"code":1932,"language":1103,"meta":1104,"style":1104},"int shotsRemaining = 0;\nwhile (shotsRemaining > 0)\n{\n    System.out.println(\"Firing shot \" + shotsRemaining);\n    shotsRemaining--;\n}\nSystem.out.println(\"Done\");\n",[1089,1934,1935,1940,1945,1949,1954,1959,1963],{"__ignoreMap":1104},[1108,1936,1937],{"class":1110,"line":1111},[1108,1938,1939],{},"int shotsRemaining = 0;\n",[1108,1941,1942],{"class":1110,"line":1117},[1108,1943,1944],{},"while (shotsRemaining > 0)\n",[1108,1946,1947],{"class":1110,"line":1123},[1108,1948,1126],{},[1108,1950,1951],{"class":1110,"line":1129},[1108,1952,1953],{},"    System.out.println(\"Firing shot \" + shotsRemaining);\n",[1108,1955,1956],{"class":1110,"line":1135},[1108,1957,1958],{},"    shotsRemaining--;\n",[1108,1960,1961],{"class":1110,"line":1141},[1108,1962,1144],{},[1108,1964,1965],{"class":1110,"line":1363},[1108,1966,1967],{},"System.out.println(\"Done\");\n",[1085,1969,1970],{},"What prints?",[1085,1972,1973],{},[1428,1974,1975],{},"Options:",[1422,1977,1978,1988,1993,2000],{},[1425,1979,1980,1981,1984,1985],{},"A. ",[1089,1982,1983],{},"Firing shot 0"," then ",[1089,1986,1987],{},"Done",[1425,1989,1990,1991],{},"B. Just ",[1089,1992,1987],{},[1425,1994,1995,1996,1999],{},"C. An infinite loop of ",[1089,1997,1998],{},"Firing shot"," lines",[1425,2001,2002,2003],{},"D. Nothing prints at all — not even ",[1089,2004,1987],{},[1085,2006,2007,2010],{},[1428,2008,2009],{},"Answer:"," B",[1085,2012,2013,2016,2017,1263,2019,2021,2022,2025,2026,2028,2029,2032,2033,2036],{},[1428,2014,2015],{},"Why:"," A ",[1089,2018,1091],{},[1094,2020,1096],{}," every pass, including the first. Here ",[1089,2023,2024],{},"shotsRemaining"," starts at ",[1089,2027,1575],{},", so ",[1089,2030,2031],{},"shotsRemaining > 0"," is false immediately — the loop body never runs, not even once. Execution just falls through to the ",[1089,2034,2035],{},"println(\"Done\")"," line that follows the loop.",[1422,2038,2039,2045,2048],{},[1425,2040,2041,2042,2044],{},"A is wrong because the loop body never executes at all when the starting condition is already false, so ",[1089,2043,1983],{}," is never printed.",[1425,2046,2047],{},"C is wrong because a loop that never starts can't run infinitely — there's no infinite loop here at all.",[1425,2049,2050,2051,2053],{},"D is wrong because the ",[1089,2052,1987],{}," line isn't inside the loop — it always runs after the loop, regardless of whether the loop body ever executed.",[1080,2055,2057],{"id":2056},"micro-parsons","Micro-Parsons",[1085,2059,2060,2063],{},[1428,2061,2062],{},"Problem:"," Given this class and main method, reorder the fragments below into the method body that simulates retrying a camera connection. Each attempt increments a counter, then marks the connection as established once at least 2 attempts have been made. Print each attempt's number and current connection status. Stop once connected, or after 5 attempts.",[1099,2065,2067],{"className":1101,"code":2066,"language":1103,"meta":1104,"style":1104},"public class ConnectionRetry\n{\n    public static void main(String[] args)\n    {\n        \u002F\u002F your reordered fragments go here\n    }\n}\n",[1089,2068,2069,2074,2078,2083,2087,2092,2096],{"__ignoreMap":1104},[1108,2070,2071],{"class":1110,"line":1111},[1108,2072,2073],{},"public class ConnectionRetry\n",[1108,2075,2076],{"class":1110,"line":1117},[1108,2077,1126],{},[1108,2079,2080],{"class":1110,"line":1123},[1108,2081,2082],{},"    public static void main(String[] args)\n",[1108,2084,2085],{"class":1110,"line":1129},[1108,2086,1350],{},[1108,2088,2089],{"class":1110,"line":1135},[1108,2090,2091],{},"        \u002F\u002F your reordered fragments go here\n",[1108,2093,2094],{"class":1110,"line":1141},[1108,2095,1360],{},[1108,2097,2098],{"class":1110,"line":1363},[1108,2099,1144],{},[1085,2101,2102],{},"Reorder the fragments below to complete it:",[1422,2104,2105,2111,2117,2123,2129,2135,2141,2147],{},[1425,2106,2107,2108],{},"a. ",[1089,2109,2110],{},"        while (!connected && attempts \u003C 5)",[1425,2112,2113,2114],{},"b. ",[1089,2115,2116],{},"            connected = (attempts >= 2);",[1425,2118,2119,2120],{},"c. ",[1089,2121,2122],{},"        boolean connected = false;",[1425,2124,2125,2126],{},"d. ",[1089,2127,2128],{},"        }",[1425,2130,2131,2132],{},"e. ",[1089,2133,2134],{},"        int attempts = 0;",[1425,2136,2137,2138],{},"f. ",[1089,2139,2140],{},"            System.out.println(\"Attempt \" + attempts + \" connected=\" + connected);",[1425,2142,2143,2144],{},"g. ",[1089,2145,2146],{},"            attempts++;",[1425,2148,2149,2150],{},"h. ",[1089,2151,2152],{},"        {",[1085,2154,2155,2157],{},[1428,2156,2009],{}," e, c, a, h, g, b, f, d",[1085,2159,2160,2163],{},[1428,2161,2162],{},"Interchangeable:"," (e, c)",[1099,2165,2167],{"className":1101,"code":2166,"language":1103,"meta":1104,"style":1104},"public class ConnectionRetry\n{\n    public static void main(String[] args)\n    {\n        int attempts = 0;\n        boolean connected = false;\n\n        while (!connected && attempts \u003C 5)\n        {\n            attempts++;\n            connected = (attempts >= 2);\n            System.out.println(\"Attempt \" + attempts + \" connected=\" + connected);\n        }\n    }\n}\n",[1089,2168,2169,2173,2177,2181,2185,2190,2195,2199,2204,2209,2214,2219,2224,2230,2235],{"__ignoreMap":1104},[1108,2170,2171],{"class":1110,"line":1111},[1108,2172,2073],{},[1108,2174,2175],{"class":1110,"line":1117},[1108,2176,1126],{},[1108,2178,2179],{"class":1110,"line":1123},[1108,2180,2082],{},[1108,2182,2183],{"class":1110,"line":1129},[1108,2184,1350],{},[1108,2186,2187],{"class":1110,"line":1135},[1108,2188,2189],{},"        int attempts = 0;\n",[1108,2191,2192],{"class":1110,"line":1141},[1108,2193,2194],{},"        boolean connected = false;\n",[1108,2196,2197],{"class":1110,"line":1363},[1108,2198,1629],{"emptyLinePlaceholder":1556},[1108,2200,2201],{"class":1110,"line":1369},[1108,2202,2203],{},"        while (!connected && attempts \u003C 5)\n",[1108,2205,2206],{"class":1110,"line":1374},[1108,2207,2208],{},"        {\n",[1108,2210,2211],{"class":1110,"line":1380},[1108,2212,2213],{},"            attempts++;\n",[1108,2215,2216],{"class":1110,"line":1386},[1108,2217,2218],{},"            connected = (attempts >= 2);\n",[1108,2220,2221],{"class":1110,"line":1391},[1108,2222,2223],{},"            System.out.println(\"Attempt \" + attempts + \" connected=\" + connected);\n",[1108,2225,2227],{"class":1110,"line":2226},13,[1108,2228,2229],{},"        }\n",[1108,2231,2233],{"class":1110,"line":2232},14,[1108,2234,1360],{},[1108,2236,2238],{"class":1110,"line":2237},15,[1108,2239,1144],{},[1085,2241,2242,2245,2246,2248,2249,2252,2253,2248,2256,2259,2260,2262,2263,2266,2267,2269,2270,2272,2273,2276,2277,2279,2280,2283,2284,1449,2286,2288,2289,2292,2293,2248,2296,2299,2300,2302,2303,2306,2307,2310],{},[1428,2243,2244],{},"Why this order:"," Both ",[1089,2247,1866],{}," (",[1089,2250,2251],{},"e",") and ",[1089,2254,2255],{},"connected",[1089,2257,2258],{},"c",") — the loop's initialize step — have to exist before the ",[1089,2261,1091],{}," header (",[1089,2264,2265],{},"a",") can test them (in either order, so ",[1089,2268,2251],{}," and ",[1089,2271,2258],{}," are marked interchangeable), and its opening brace (",[1089,2274,2275],{},"h",") follows right after. Inside the loop, ",[1089,2278,1866],{}," has to be incremented (",[1089,2281,2282],{},"g",") ",[1094,2285,1096],{},[1089,2287,2255],{}," is recomputed (",[1089,2290,2291],{},"b","), since the connection check depends on the updated count. The ",[1089,2294,2295],{},"println",[1089,2297,2298],{},"f",") comes last in the body because it reports both values ",[1094,2301,1266],{}," they've been updated for this pass, and the closing brace (",[1089,2304,2305],{},"d",") ends the loop. The surrounding class and ",[1089,2308,2309],{},"main"," method are the given scaffold; only the declarations and the loop needed reordering.",[1080,2312,2314],{"id":2313},"coding","Coding",[1085,2316,2317,2320],{},[1428,2318,2319],{},"Mode:"," harness",[1085,2322,2323,2325,2326,2329,2330,2333,2334,2337,2338,2340,2341,2343,2344,2346,2347,2349,2350,2353,2354,2356,2357,2359,2360,1815],{},[1428,2324,2062],{}," A shop has ",[1089,2327,2328],{},"remaining"," batteries to charge and its chargers handle ",[1089,2331,2332],{},"perDay"," batteries each\nday. Write ",[1089,2335,2336],{},"daysToFinish",", which returns how many days it takes to charge them all. Use a ",[1089,2339,1091],{}," loop: each\npass is one day, and each day charges ",[1089,2342,2332],{}," batteries (the last day may charge fewer than ",[1089,2345,2332],{},", which\nis fine). ",[1089,2348,2332],{}," is always at least ",[1089,2351,2352],{},"1",". If there is nothing left to charge (",[1089,2355,2328],{}," is ",[1089,2358,1575],{}," or less),\nthe answer is ",[1089,2361,1575],{},[1085,2363,2364],{},"Examples:",[1422,2366,2367,2377,2385],{},[1425,2368,2369,2372,2373,2376],{},[1089,2370,2371],{},"daysToFinish(10, 3)"," returns ",[1089,2374,2375],{},"4"," (3, then 3, then 3, then the last 1)",[1425,2378,2379,2372,2382],{},[1089,2380,2381],{},"daysToFinish(9, 3)",[1089,2383,2384],{},"3",[1425,2386,2387,2372,2390],{},[1089,2388,2389],{},"daysToFinish(1, 5)",[1089,2391,2352],{},[1085,2393,2394,1449,2397],{},[1428,2395,2396],{},"Signature:",[1089,2398,2399],{},"public static int daysToFinish(int remaining, int perDay)",[1085,2401,2402],{},[1428,2403,2404],{},"Starter:",[1099,2406,2408],{"className":1101,"code":2407,"language":1103,"meta":1104,"style":1104},"public class Solution\n{\n    public static int daysToFinish(int remaining, int perDay)\n    {\n        \u002F\u002F TODO: count the days in a while loop\n    }\n}\n",[1089,2409,2410,2415,2419,2424,2428,2433,2437],{"__ignoreMap":1104},[1108,2411,2412],{"class":1110,"line":1111},[1108,2413,2414],{},"public class Solution\n",[1108,2416,2417],{"class":1110,"line":1117},[1108,2418,1126],{},[1108,2420,2421],{"class":1110,"line":1123},[1108,2422,2423],{},"    public static int daysToFinish(int remaining, int perDay)\n",[1108,2425,2426],{"class":1110,"line":1129},[1108,2427,1350],{},[1108,2429,2430],{"class":1110,"line":1135},[1108,2431,2432],{},"        \u002F\u002F TODO: count the days in a while loop\n",[1108,2434,2435],{"class":1110,"line":1141},[1108,2436,1360],{},[1108,2438,2439],{"class":1110,"line":1363},[1108,2440,1144],{},[1085,2442,2443],{},[1428,2444,2445],{},"Tests:",[1712,2447,2448,2461],{},[1715,2449,2450],{},[1718,2451,2452,2455,2458],{},[1721,2453,2454],{},"Visible",[1721,2456,2457],{},"Arguments",[1721,2459,2460],{},"Expected",[1737,2462,2463,2476,2489,2502,2515,2528,2541],{},[1718,2464,2465,2467,2472],{},[1742,2466,1752],{},[1742,2468,2469],{},[1089,2470,2471],{},"10, 3",[1742,2473,2474],{},[1089,2475,2375],{},[1718,2477,2478,2480,2485],{},[1742,2479,1752],{},[1742,2481,2482],{},[1089,2483,2484],{},"9, 3",[1742,2486,2487],{},[1089,2488,2384],{},[1718,2490,2491,2493,2498],{},[1742,2492,1752],{},[1742,2494,2495],{},[1089,2496,2497],{},"1, 5",[1742,2499,2500],{},[1089,2501,2352],{},[1718,2503,2504,2506,2511],{},[1742,2505,1802],{},[1742,2507,2508],{},[1089,2509,2510],{},"0, 4",[1742,2512,2513],{},[1089,2514,1575],{},[1718,2516,2517,2519,2524],{},[1742,2518,1802],{},[1742,2520,2521],{},[1089,2522,2523],{},"-2, 3",[1742,2525,2526],{},[1089,2527,1575],{},[1718,2529,2530,2532,2537],{},[1742,2531,1802],{},[1742,2533,2534],{},[1089,2535,2536],{},"12, 4",[1742,2538,2539],{},[1089,2540,2384],{},[1718,2542,2543,2545,2550],{},[1742,2544,1802],{},[1742,2546,2547],{},[1089,2548,2549],{},"13, 4",[1742,2551,2552],{},[1089,2553,2375],{},[1085,2555,2556],{},[1428,2557,2558],{},"Solution:",[1099,2560,2562],{"className":1101,"code":2561,"language":1103,"meta":1104,"style":1104},"public class Solution\n{\n    public static int daysToFinish(int remaining, int perDay)\n    {\n        int days = 0;\n        while (remaining > 0)\n        {\n            remaining = remaining - perDay;\n            days++;\n        }\n        return days;\n    }\n}\n",[1089,2563,2564,2568,2572,2576,2580,2585,2590,2594,2599,2604,2608,2613,2617],{"__ignoreMap":1104},[1108,2565,2566],{"class":1110,"line":1111},[1108,2567,2414],{},[1108,2569,2570],{"class":1110,"line":1117},[1108,2571,1126],{},[1108,2573,2574],{"class":1110,"line":1123},[1108,2575,2423],{},[1108,2577,2578],{"class":1110,"line":1129},[1108,2579,1350],{},[1108,2581,2582],{"class":1110,"line":1135},[1108,2583,2584],{},"        int days = 0;\n",[1108,2586,2587],{"class":1110,"line":1141},[1108,2588,2589],{},"        while (remaining > 0)\n",[1108,2591,2592],{"class":1110,"line":1363},[1108,2593,2208],{},[1108,2595,2596],{"class":1110,"line":1369},[1108,2597,2598],{},"            remaining = remaining - perDay;\n",[1108,2600,2601],{"class":1110,"line":1374},[1108,2602,2603],{},"            days++;\n",[1108,2605,2606],{"class":1110,"line":1380},[1108,2607,2229],{},[1108,2609,2610],{"class":1110,"line":1386},[1108,2611,2612],{},"        return days;\n",[1108,2614,2615],{"class":1110,"line":1391},[1108,2616,1360],{},[1108,2618,2619],{"class":1110,"line":2226},[1108,2620,1144],{},[1085,2622,2623,2625,2626,2269,2629,2631,2632,2635,2636,2638,2639,2641,2642,2644,2645,2647,2648,2650,2651,2653,2654,2656,2657,2269,2659,1815],{},[1428,2624,2015],{}," The loop's three steps are all there: ",[1089,2627,2628],{},"days",[1089,2630,2328],{}," start before the loop, the test\n",[1089,2633,2634],{},"remaining > 0"," is checked before every pass, and ",[1089,2637,2328],{}," shrinks inside the body so the loop\neventually ends (forget that update line and the method never returns). Because a ",[1089,2640,1091],{}," checks first, a\nstarting ",[1089,2643,2328],{}," of ",[1089,2646,1575],{}," or less runs the body zero times and returns ",[1089,2649,1575],{},". A ",[1089,2652,1262],{}," would run the body\nonce before checking, wrongly giving ",[1089,2655,2352],{}," for ",[1089,2658,2510],{},[1089,2660,2523],{},[1539,2662,1541],{},{"title":1104,"searchDepth":1117,"depth":1117,"links":2664},[2665,2666,2667],{"id":1923,"depth":1117,"text":1924},{"id":2056,"depth":1117,"text":2057},{"id":2313,"depth":1117,"text":2314},{"outlineRef":1554,"pairsWith":1910,"status":2669},"new — authored exercises (Multiple Choice + Micro-Parsons + Coding)",{"title":852,"description":1104},"sV8jEZnB2YCvmD_vw4qdr3S61HAQAdPf7HiDBFrGJPg",1792718164819]