[{"data":1,"prerenderedAt":2950},["ShallowReactive",2],{"item-lessons-light-ch09-storing-data":3,"item-examples-light-ch09-storing-data":444,"item-exercises-light-ch09-storing-data":753,"item-lesson-full-ch09-storing-data-9.5":1070,"item-example-full-ch09-storing-data-9.5":1703,"item-exercise-full-ch09-storing-data-9.5":2170},[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":158,"body":1072,"description":1082,"extension":1697,"meta":1698,"navigation":1367,"path":157,"seo":1701,"stem":159,"__hash__":1702},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md",{"type":1073,"value":1074,"toc":1686},"minimark",[1075,1079,1083,1088,1136,1140,1190,1194,1252,1283,1287,1290,1313,1317,1470,1474,1477,1500,1503,1539,1543,1596,1600,1653,1657,1671,1682],[1076,1077,158],"h1",{"id":1078},"implementing-array-algorithms",[1080,1081,1082],"p",{},"A handful of patterns, all built from a loop plus a little bookkeeping, cover almost everything you'll want to do with an array.",[1084,1085,1087],"h2",{"id":1086},"sum-average-accumulator","Sum \u002F Average (Accumulator)",[1089,1090,1095],"pre",{"className":1091,"code":1092,"language":1093,"meta":1094,"style":1094},"language-java shiki shiki-themes github-light github-dark","double sum = 0;\nfor (double reading : sensorReadings)\n{\n    sum += reading;\n}\ndouble average = sum \u002F sensorReadings.length;\n","java","",[1096,1097,1098,1106,1112,1118,1124,1130],"code",{"__ignoreMap":1094},[1099,1100,1103],"span",{"class":1101,"line":1102},"line",1,[1099,1104,1105],{},"double sum = 0;\n",[1099,1107,1109],{"class":1101,"line":1108},2,[1099,1110,1111],{},"for (double reading : sensorReadings)\n",[1099,1113,1115],{"class":1101,"line":1114},3,[1099,1116,1117],{},"{\n",[1099,1119,1121],{"class":1101,"line":1120},4,[1099,1122,1123],{},"    sum += reading;\n",[1099,1125,1127],{"class":1101,"line":1126},5,[1099,1128,1129],{},"}\n",[1099,1131,1133],{"class":1101,"line":1132},6,[1099,1134,1135],{},"double average = sum \u002F sensorReadings.length;\n",[1084,1137,1139],{"id":1138},"min-max","Min \u002F Max",[1089,1141,1143],{"className":1091,"code":1142,"language":1093,"meta":1094,"style":1094},"\u002F\u002F seed with the first element, not 0 — a reading could be negative\ndouble max = sensorReadings[0];\nfor (double reading : sensorReadings)\n{\n    if (reading > max)\n    {\n        max = reading;\n    }\n}\n",[1096,1144,1145,1150,1155,1159,1163,1168,1173,1179,1185],{"__ignoreMap":1094},[1099,1146,1147],{"class":1101,"line":1102},[1099,1148,1149],{},"\u002F\u002F seed with the first element, not 0 — a reading could be negative\n",[1099,1151,1152],{"class":1101,"line":1108},[1099,1153,1154],{},"double max = sensorReadings[0];\n",[1099,1156,1157],{"class":1101,"line":1114},[1099,1158,1111],{},[1099,1160,1161],{"class":1101,"line":1120},[1099,1162,1117],{},[1099,1164,1165],{"class":1101,"line":1126},[1099,1166,1167],{},"    if (reading > max)\n",[1099,1169,1170],{"class":1101,"line":1132},[1099,1171,1172],{},"    {\n",[1099,1174,1176],{"class":1101,"line":1175},7,[1099,1177,1178],{},"        max = reading;\n",[1099,1180,1182],{"class":1101,"line":1181},8,[1099,1183,1184],{},"    }\n",[1099,1186,1188],{"class":1101,"line":1187},9,[1099,1189,1129],{},[1084,1191,1193],{"id":1192},"search-check-everything-before-giving-up","Search — Check Everything Before Giving Up",[1089,1195,1197],{"className":1091,"code":1196,"language":1093,"meta":1094,"style":1094},"public static boolean contains(double[] values, double target)\n{\n    for (double v : values)\n    {\n        if (v == target)\n        {\n            return true; \u002F\u002F fine to return early on a MATCH\n        }\n    }\n    return false; \u002F\u002F only after checking every element\n}\n",[1096,1198,1199,1204,1208,1213,1217,1222,1227,1232,1237,1241,1247],{"__ignoreMap":1094},[1099,1200,1201],{"class":1101,"line":1102},[1099,1202,1203],{},"public static boolean contains(double[] values, double target)\n",[1099,1205,1206],{"class":1101,"line":1108},[1099,1207,1117],{},[1099,1209,1210],{"class":1101,"line":1114},[1099,1211,1212],{},"    for (double v : values)\n",[1099,1214,1215],{"class":1101,"line":1120},[1099,1216,1172],{},[1099,1218,1219],{"class":1101,"line":1126},[1099,1220,1221],{},"        if (v == target)\n",[1099,1223,1224],{"class":1101,"line":1132},[1099,1225,1226],{},"        {\n",[1099,1228,1229],{"class":1101,"line":1175},[1099,1230,1231],{},"            return true; \u002F\u002F fine to return early on a MATCH\n",[1099,1233,1234],{"class":1101,"line":1181},[1099,1235,1236],{},"        }\n",[1099,1238,1239],{"class":1101,"line":1187},[1099,1240,1184],{},[1099,1242,1244],{"class":1101,"line":1243},10,[1099,1245,1246],{},"    return false; \u002F\u002F only after checking every element\n",[1099,1248,1250],{"class":1101,"line":1249},11,[1099,1251,1129],{},[1080,1253,1254,1257,1258,1261,1262,1265,1266,1269,1270,1274,1275,1278,1279,1282],{},[1096,1255,1256],{},"v == target"," only makes sense when ",[1096,1259,1260],{},"target"," is a value you know is exact (a literal you just assigned, or an ",[1096,1263,1264],{},"int","\u002F",[1096,1267,1268],{},"long"," count). Comparing ",[1271,1272,1273],"em",{},"computed"," or measured ",[1096,1276,1277],{},"double","s this way is risky (Ch.2.4, Ch.5.4) — use a tolerance comparison (",[1096,1280,1281],{},"Math.abs(v - target) \u003C tolerance",") instead when either side came from a calculation or a sensor.",[1084,1284,1286],{"id":1285},"looping-back-to-front","Looping Back to Front",[1080,1288,1289],{},"Same shape, just counting down:",[1089,1291,1293],{"className":1091,"code":1292,"language":1093,"meta":1094,"style":1094},"for (int i = values.length - 1; i >= 0; i--)\n{\n    \u002F\u002F process values[i], starting from the end\n}\n",[1096,1294,1295,1300,1304,1309],{"__ignoreMap":1094},[1099,1296,1297],{"class":1101,"line":1102},[1099,1298,1299],{},"for (int i = values.length - 1; i >= 0; i--)\n",[1099,1301,1302],{"class":1101,"line":1108},[1099,1303,1117],{},[1099,1305,1306],{"class":1101,"line":1114},[1099,1307,1308],{},"    \u002F\u002F process values[i], starting from the end\n",[1099,1310,1311],{"class":1101,"line":1120},[1099,1312,1129],{},[1084,1314,1316],{"id":1315},"at-least-one-all-count","\"At Least One\" \u002F \"All\" \u002F \"Count\"",[1089,1318,1320],{"className":1091,"code":1319,"language":1093,"meta":1094,"style":1094},"\u002F\u002F at least one has the property\nfor (double v : values)\n{\n    if (isFaulty(v))\n    {\n        return true;\n    }\n}\nreturn false;\n\n\u002F\u002F all have the property (check the NEGATION, bail early on a counter-example)\nfor (double v : values)\n{\n    if (!isFaulty(v))\n    {\n        return false;\n    }\n}\nreturn true;\n\n\u002F\u002F count how many have the property\nint count = 0;\nfor (double v : values)\n{\n    if (isFaulty(v))\n    {\n        count++;\n    }\n}\n",[1096,1321,1322,1327,1332,1336,1341,1345,1350,1354,1358,1363,1369,1374,1379,1384,1390,1395,1401,1406,1411,1417,1422,1428,1434,1439,1444,1449,1454,1460,1465],{"__ignoreMap":1094},[1099,1323,1324],{"class":1101,"line":1102},[1099,1325,1326],{},"\u002F\u002F at least one has the property\n",[1099,1328,1329],{"class":1101,"line":1108},[1099,1330,1331],{},"for (double v : values)\n",[1099,1333,1334],{"class":1101,"line":1114},[1099,1335,1117],{},[1099,1337,1338],{"class":1101,"line":1120},[1099,1339,1340],{},"    if (isFaulty(v))\n",[1099,1342,1343],{"class":1101,"line":1126},[1099,1344,1172],{},[1099,1346,1347],{"class":1101,"line":1132},[1099,1348,1349],{},"        return true;\n",[1099,1351,1352],{"class":1101,"line":1175},[1099,1353,1184],{},[1099,1355,1356],{"class":1101,"line":1181},[1099,1357,1129],{},[1099,1359,1360],{"class":1101,"line":1187},[1099,1361,1362],{},"return false;\n",[1099,1364,1365],{"class":1101,"line":1243},[1099,1366,1368],{"emptyLinePlaceholder":1367},true,"\n",[1099,1370,1371],{"class":1101,"line":1249},[1099,1372,1373],{},"\u002F\u002F all have the property (check the NEGATION, bail early on a counter-example)\n",[1099,1375,1377],{"class":1101,"line":1376},12,[1099,1378,1331],{},[1099,1380,1382],{"class":1101,"line":1381},13,[1099,1383,1117],{},[1099,1385,1387],{"class":1101,"line":1386},14,[1099,1388,1389],{},"    if (!isFaulty(v))\n",[1099,1391,1393],{"class":1101,"line":1392},15,[1099,1394,1172],{},[1099,1396,1398],{"class":1101,"line":1397},16,[1099,1399,1400],{},"        return false;\n",[1099,1402,1404],{"class":1101,"line":1403},17,[1099,1405,1184],{},[1099,1407,1409],{"class":1101,"line":1408},18,[1099,1410,1129],{},[1099,1412,1414],{"class":1101,"line":1413},19,[1099,1415,1416],{},"return true;\n",[1099,1418,1420],{"class":1101,"line":1419},20,[1099,1421,1368],{"emptyLinePlaceholder":1367},[1099,1423,1425],{"class":1101,"line":1424},21,[1099,1426,1427],{},"\u002F\u002F count how many have the property\n",[1099,1429,1431],{"class":1101,"line":1430},22,[1099,1432,1433],{},"int count = 0;\n",[1099,1435,1437],{"class":1101,"line":1436},23,[1099,1438,1331],{},[1099,1440,1442],{"class":1101,"line":1441},24,[1099,1443,1117],{},[1099,1445,1447],{"class":1101,"line":1446},25,[1099,1448,1340],{},[1099,1450,1452],{"class":1101,"line":1451},26,[1099,1453,1172],{},[1099,1455,1457],{"class":1101,"line":1456},27,[1099,1458,1459],{},"        count++;\n",[1099,1461,1463],{"class":1101,"line":1462},28,[1099,1464,1184],{},[1099,1466,1468],{"class":1101,"line":1467},29,[1099,1469,1129],{},[1084,1471,1473],{"id":1472},"duplicates","Duplicates",[1080,1475,1476],{},"Adjacent only — a single loop comparing neighbors:",[1089,1478,1480],{"className":1091,"code":1479,"language":1093,"meta":1094,"style":1094},"for (int i = 0; i \u003C values.length - 1; i++)\n{\n    if (values[i] == values[i + 1]) return true;\n}\n",[1096,1481,1482,1487,1491,1496],{"__ignoreMap":1094},[1099,1483,1484],{"class":1101,"line":1102},[1099,1485,1486],{},"for (int i = 0; i \u003C values.length - 1; i++)\n",[1099,1488,1489],{"class":1101,"line":1108},[1099,1490,1117],{},[1099,1492,1493],{"class":1101,"line":1114},[1099,1494,1495],{},"    if (values[i] == values[i + 1]) return true;\n",[1099,1497,1498],{"class":1101,"line":1120},[1099,1499,1129],{},[1080,1501,1502],{},"Anywhere in the array — a nested loop comparing every pair:",[1089,1504,1506],{"className":1091,"code":1505,"language":1093,"meta":1094,"style":1094},"for (int i = 0; i \u003C values.length; i++)\n{\n    for (int j = i + 1; j \u003C values.length; j++)\n    {\n        if (values[i] == values[j]) return true;\n    }\n}\n",[1096,1507,1508,1513,1517,1522,1526,1531,1535],{"__ignoreMap":1094},[1099,1509,1510],{"class":1101,"line":1102},[1099,1511,1512],{},"for (int i = 0; i \u003C values.length; i++)\n",[1099,1514,1515],{"class":1101,"line":1108},[1099,1516,1117],{},[1099,1518,1519],{"class":1101,"line":1114},[1099,1520,1521],{},"    for (int j = i + 1; j \u003C values.length; j++)\n",[1099,1523,1524],{"class":1101,"line":1120},[1099,1525,1172],{},[1099,1527,1528],{"class":1101,"line":1126},[1099,1529,1530],{},"        if (values[i] == values[j]) return true;\n",[1099,1532,1533],{"class":1101,"line":1132},[1099,1534,1184],{},[1099,1536,1537],{"class":1101,"line":1175},[1099,1538,1129],{},[1084,1540,1542],{"id":1541},"reversing-swap-from-both-ends","Reversing (Swap From Both Ends)",[1089,1544,1546],{"className":1091,"code":1545,"language":1093,"meta":1094,"style":1094},"int start = 0;\nint end = values.length - 1;\nwhile (start \u003C end)\n{\n    double temp = values[start];\n    values[start] = values[end];\n    values[end] = temp;\n    start++;\n    end--;\n}\n",[1096,1547,1548,1553,1558,1563,1567,1572,1577,1582,1587,1592],{"__ignoreMap":1094},[1099,1549,1550],{"class":1101,"line":1102},[1099,1551,1552],{},"int start = 0;\n",[1099,1554,1555],{"class":1101,"line":1108},[1099,1556,1557],{},"int end = values.length - 1;\n",[1099,1559,1560],{"class":1101,"line":1114},[1099,1561,1562],{},"while (start \u003C end)\n",[1099,1564,1565],{"class":1101,"line":1120},[1099,1566,1117],{},[1099,1568,1569],{"class":1101,"line":1126},[1099,1570,1571],{},"    double temp = values[start];\n",[1099,1573,1574],{"class":1101,"line":1132},[1099,1575,1576],{},"    values[start] = values[end];\n",[1099,1578,1579],{"class":1101,"line":1175},[1099,1580,1581],{},"    values[end] = temp;\n",[1099,1583,1584],{"class":1101,"line":1181},[1099,1585,1586],{},"    start++;\n",[1099,1588,1589],{"class":1101,"line":1187},[1099,1590,1591],{},"    end--;\n",[1099,1593,1594],{"class":1101,"line":1243},[1099,1595,1129],{},[1084,1597,1599],{"id":1598},"common-pitfalls","Common Pitfalls",[1601,1602,1603,1621,1631],"ul",{},[1604,1605,1606,1614,1615,1617,1618,1620],"li",{},[1607,1608,1609,1610,1613],"strong",{},"Seeding min\u002Fmax with ",[1096,1611,1612],{},"0"," instead of the first element."," If every real value is negative, ",[1096,1616,1612],{}," looks like a (wrong) max that never gets beaten; if every real value is positive, ",[1096,1619,1612],{}," looks like a (wrong) min that never gets beaten. Seeding with the first element avoids both failure modes.",[1604,1622,1623,1626,1627,1630],{},[1607,1624,1625],{},"Returning \"not found\" from inside the loop."," Only a ",[1271,1628,1629],{},"match"," should return early; \"not found\" has to wait until the loop has checked every element.",[1604,1632,1633,1644,1645,1648,1649,1652],{},[1607,1634,1635,1636,1639,1640,1643],{},"Comparing ",[1096,1637,1638],{},"values[i]"," to ",[1096,1641,1642],{},"values[i+1]"," all the way to the last index."," This reads one past the end — the adjacent-duplicate loop must stop at ",[1096,1646,1647],{},"length - 2"," (i.e., bound the loop by ",[1096,1650,1651],{},"i \u003C values.length - 1",").",[1084,1654,1656],{"id":1655},"key-takeaways","Key Takeaways",[1601,1658,1659,1662,1665,1668],{},[1604,1660,1661],{},"Sum\u002Faverage, min\u002Fmax, search, and property-counting are all the same basic shape: a loop plus a little state (an accumulator, a running best, a counter, or an early return).",[1604,1663,1664],{},"A search for \"not found\" must check every element before concluding absence; a search for a match can return the instant it's found.",[1604,1666,1667],{},"Adjacent-duplicate checks are a single loop; any-pair duplicate checks need a nested loop.",[1604,1669,1670],{},"Reversing in place swaps from both ends toward the middle using a temporary variable.",[1080,1672,1673,1674,1677,1678,1681],{},"Derived from ",[1096,1675,1676],{},"csawesome-2026",": ",[1096,1679,1680],{},"unit-4-data-collections\u002F4.05-implementing-array-algorithms.md"," (CSA 4.5)",[1683,1684,1685],"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":1094,"searchDepth":1108,"depth":1108,"links":1687},[1688,1689,1690,1691,1692,1693,1694,1695,1696],{"id":1086,"depth":1108,"text":1087},{"id":1138,"depth":1108,"text":1139},{"id":1192,"depth":1108,"text":1193},{"id":1285,"depth":1108,"text":1286},{"id":1315,"depth":1108,"text":1316},{"id":1472,"depth":1108,"text":1473},{"id":1541,"depth":1108,"text":1542},{"id":1598,"depth":1108,"text":1599},{"id":1655,"depth":1108,"text":1656},"md",{"outlineRef":1699,"status":1700},"9.5 — Implementing Array Algorithms (CSA 4.5)","new — authored lesson (fuller depth than the teaser slide)",{"title":158,"description":1082},"ZqwqOt6FUnXWNcnMPF7V-qEmCqG47WkidTUrs_CciiA",{"id":1704,"title":595,"body":1705,"description":1094,"extension":1697,"meta":2165,"navigation":1367,"path":594,"seo":2168,"stem":596,"__hash__":2169},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md",{"type":1073,"value":1706,"toc":2154},[1707,1710,1714,1717,1721,1724,1745,1754,1758,1795,1799,1812,1857,1861,1864,1916,1925,1934,1938,1983,1987,2001,2055,2064,2068,2071,2125,2129,2152],[1076,1708,595],{"id":1709},"implementing-array-algorithms-worked-example",[1084,1711,1713],{"id":1712},"problem","Problem",[1080,1715,1716],{},"Given this weekend's practice-match scores, find the average, find the highest score, check whether the team ever scored exactly 100, count how many matches scored 40 or above, check for two matches in a row with the exact same score, and produce a reversed copy for a \"most recent first\" display.",[1084,1718,1720],{"id":1719},"step-1-plan-it-first","Step 1: Plan It First",[1080,1722,1723],{},"Six small tasks, each one of the standard array-algorithm patterns:",[1725,1726,1727,1730,1733,1736,1739,1742],"ol",{},[1604,1728,1729],{},"Average — accumulator.",[1604,1731,1732],{},"Highest score — running max.",[1604,1734,1735],{},"Ever scored exactly 100 — search.",[1604,1737,1738],{},"Count of matches at or above 40 — property count.",[1604,1740,1741],{},"Two matches in a row with the same score — adjacent duplicates.",[1604,1743,1744],{},"Most-recent-first order — reverse in place.",[1089,1746,1748],{"className":1091,"code":1747,"language":1093,"meta":1094,"style":1094},"double[] matchScores = {38.0, 45.5, 45.5, 52.0, 40.0};\n",[1096,1749,1750],{"__ignoreMap":1094},[1099,1751,1752],{"class":1101,"line":1102},[1099,1753,1747],{},[1084,1755,1757],{"id":1756},"step-2-average-accumulator","Step 2: Average (Accumulator)",[1089,1759,1761],{"className":1091,"code":1760,"language":1093,"meta":1094,"style":1094},"double sum = 0;\nfor (double score : matchScores)\n{\n    sum += score;\n}\ndouble average = sum \u002F matchScores.length;\nSystem.out.println(average); \u002F\u002F 44.2\n",[1096,1762,1763,1767,1772,1776,1781,1785,1790],{"__ignoreMap":1094},[1099,1764,1765],{"class":1101,"line":1102},[1099,1766,1105],{},[1099,1768,1769],{"class":1101,"line":1108},[1099,1770,1771],{},"for (double score : matchScores)\n",[1099,1773,1774],{"class":1101,"line":1114},[1099,1775,1117],{},[1099,1777,1778],{"class":1101,"line":1120},[1099,1779,1780],{},"    sum += score;\n",[1099,1782,1783],{"class":1101,"line":1126},[1099,1784,1129],{},[1099,1786,1787],{"class":1101,"line":1132},[1099,1788,1789],{},"double average = sum \u002F matchScores.length;\n",[1099,1791,1792],{"class":1101,"line":1175},[1099,1793,1794],{},"System.out.println(average); \u002F\u002F 44.2\n",[1084,1796,1798],{"id":1797},"step-3-highest-score-running-max","Step 3: Highest Score (Running Max)",[1080,1800,1801,1802,1805,1806,1808,1809,1811],{},"Seed ",[1096,1803,1804],{},"max"," with the first element, not ",[1096,1807,1612],{}," — a score could theoretically be recorded as a negative correction, and ",[1096,1810,1612],{}," isn't guaranteed to be a real lower bound:",[1089,1813,1815],{"className":1091,"code":1814,"language":1093,"meta":1094,"style":1094},"double max = matchScores[0];\nfor (double score : matchScores)\n{\n    if (score > max)\n    {\n        max = score;\n    }\n}\nSystem.out.println(max); \u002F\u002F 52.0\n",[1096,1816,1817,1822,1826,1830,1835,1839,1844,1848,1852],{"__ignoreMap":1094},[1099,1818,1819],{"class":1101,"line":1102},[1099,1820,1821],{},"double max = matchScores[0];\n",[1099,1823,1824],{"class":1101,"line":1108},[1099,1825,1771],{},[1099,1827,1828],{"class":1101,"line":1114},[1099,1829,1117],{},[1099,1831,1832],{"class":1101,"line":1120},[1099,1833,1834],{},"    if (score > max)\n",[1099,1836,1837],{"class":1101,"line":1126},[1099,1838,1172],{},[1099,1840,1841],{"class":1101,"line":1132},[1099,1842,1843],{},"        max = score;\n",[1099,1845,1846],{"class":1101,"line":1175},[1099,1847,1184],{},[1099,1849,1850],{"class":1101,"line":1181},[1099,1851,1129],{},[1099,1853,1854],{"class":1101,"line":1187},[1099,1855,1856],{},"System.out.println(max); \u002F\u002F 52.0\n",[1084,1858,1860],{"id":1859},"step-4-ever-scored-exactly-100-search","Step 4: Ever Scored Exactly 100 (Search)",[1080,1862,1863],{},"A match should return the instant it's found — but \"not found\" can only be concluded after every element has been checked:",[1089,1865,1867],{"className":1091,"code":1866,"language":1093,"meta":1094,"style":1094},"public static boolean everScored(double[] scores, double target)\n{\n    for (double score : scores)\n    {\n        if (score == target)\n        {\n            return true; \u002F\u002F fine to return early on a MATCH\n        }\n    }\n    return false; \u002F\u002F only after checking every element\n}\n",[1096,1868,1869,1874,1878,1883,1887,1892,1896,1900,1904,1908,1912],{"__ignoreMap":1094},[1099,1870,1871],{"class":1101,"line":1102},[1099,1872,1873],{},"public static boolean everScored(double[] scores, double target)\n",[1099,1875,1876],{"class":1101,"line":1108},[1099,1877,1117],{},[1099,1879,1880],{"class":1101,"line":1114},[1099,1881,1882],{},"    for (double score : scores)\n",[1099,1884,1885],{"class":1101,"line":1120},[1099,1886,1172],{},[1099,1888,1889],{"class":1101,"line":1126},[1099,1890,1891],{},"        if (score == target)\n",[1099,1893,1894],{"class":1101,"line":1132},[1099,1895,1226],{},[1099,1897,1898],{"class":1101,"line":1175},[1099,1899,1231],{},[1099,1901,1902],{"class":1101,"line":1181},[1099,1903,1236],{},[1099,1905,1906],{"class":1101,"line":1187},[1099,1907,1184],{},[1099,1909,1910],{"class":1101,"line":1243},[1099,1911,1246],{},[1099,1913,1914],{"class":1101,"line":1249},[1099,1915,1129],{},[1089,1917,1919],{"className":1091,"code":1918,"language":1093,"meta":1094,"style":1094},"System.out.println(everScored(matchScores, 100.0)); \u002F\u002F false\n",[1096,1920,1921],{"__ignoreMap":1094},[1099,1922,1923],{"class":1101,"line":1102},[1099,1924,1918],{},[1080,1926,1927,1930,1931,1933],{},[1096,1928,1929],{},"score == target"," is safe here only because every value involved is a literal typed directly into the source (no computed or sensor-read value on either side) — comparing ",[1271,1932,1273],{}," doubles this way is risky (Ch.2.4, Ch.5.4); a tolerance comparison is the general-purpose fix.",[1084,1935,1937],{"id":1936},"step-5-count-of-matches-at-or-above-40-property-count","Step 5: Count of Matches at or Above 40 (Property Count)",[1089,1939,1941],{"className":1091,"code":1940,"language":1093,"meta":1094,"style":1094},"int qualifyingCount = 0;\nfor (double score : matchScores)\n{\n    if (score >= 40.0)\n    {\n        qualifyingCount++;\n    }\n}\nSystem.out.println(qualifyingCount); \u002F\u002F 4\n",[1096,1942,1943,1948,1952,1956,1961,1965,1970,1974,1978],{"__ignoreMap":1094},[1099,1944,1945],{"class":1101,"line":1102},[1099,1946,1947],{},"int qualifyingCount = 0;\n",[1099,1949,1950],{"class":1101,"line":1108},[1099,1951,1771],{},[1099,1953,1954],{"class":1101,"line":1114},[1099,1955,1117],{},[1099,1957,1958],{"class":1101,"line":1120},[1099,1959,1960],{},"    if (score >= 40.0)\n",[1099,1962,1963],{"class":1101,"line":1126},[1099,1964,1172],{},[1099,1966,1967],{"class":1101,"line":1132},[1099,1968,1969],{},"        qualifyingCount++;\n",[1099,1971,1972],{"class":1101,"line":1175},[1099,1973,1184],{},[1099,1975,1976],{"class":1101,"line":1181},[1099,1977,1129],{},[1099,1979,1980],{"class":1101,"line":1187},[1099,1981,1982],{},"System.out.println(qualifyingCount); \u002F\u002F 4\n",[1084,1984,1986],{"id":1985},"step-6-two-matches-in-a-row-with-the-same-score-adjacent-duplicates","Step 6: Two Matches in a Row With the Same Score (Adjacent Duplicates)",[1080,1988,1989,1990,1639,1993,1996,1997,2000],{},"Only neighboring elements matter here, so a single loop comparing ",[1096,1991,1992],{},"matchScores[i]",[1096,1994,1995],{},"matchScores[i + 1]"," is enough — bounded by ",[1096,1998,1999],{},"length - 1"," so it never reads one past the end:",[1089,2002,2004],{"className":1091,"code":2003,"language":1093,"meta":1094,"style":1094},"public static boolean hasBackToBackTie(double[] scores)\n{\n    for (int i = 0; i \u003C scores.length - 1; i++)\n    {\n        if (scores[i] == scores[i + 1])\n        {\n            return true;\n        }\n    }\n    return false;\n}\n",[1096,2005,2006,2011,2015,2020,2024,2029,2033,2038,2042,2046,2051],{"__ignoreMap":1094},[1099,2007,2008],{"class":1101,"line":1102},[1099,2009,2010],{},"public static boolean hasBackToBackTie(double[] scores)\n",[1099,2012,2013],{"class":1101,"line":1108},[1099,2014,1117],{},[1099,2016,2017],{"class":1101,"line":1114},[1099,2018,2019],{},"    for (int i = 0; i \u003C scores.length - 1; i++)\n",[1099,2021,2022],{"class":1101,"line":1120},[1099,2023,1172],{},[1099,2025,2026],{"class":1101,"line":1126},[1099,2027,2028],{},"        if (scores[i] == scores[i + 1])\n",[1099,2030,2031],{"class":1101,"line":1132},[1099,2032,1226],{},[1099,2034,2035],{"class":1101,"line":1175},[1099,2036,2037],{},"            return true;\n",[1099,2039,2040],{"class":1101,"line":1181},[1099,2041,1236],{},[1099,2043,2044],{"class":1101,"line":1187},[1099,2045,1184],{},[1099,2047,2048],{"class":1101,"line":1243},[1099,2049,2050],{},"    return false;\n",[1099,2052,2053],{"class":1101,"line":1249},[1099,2054,1129],{},[1089,2056,2058],{"className":1091,"code":2057,"language":1093,"meta":1094,"style":1094},"System.out.println(hasBackToBackTie(matchScores)); \u002F\u002F true — matches 2 and 3 both scored 45.5\n",[1096,2059,2060],{"__ignoreMap":1094},[1099,2061,2062],{"class":1101,"line":1102},[1099,2063,2057],{},[1084,2065,2067],{"id":2066},"step-7-most-recent-first-order-reverse-in-place","Step 7: Most-Recent-First Order (Reverse in Place)",[1080,2069,2070],{},"Swap from both ends toward the middle using a temporary variable:",[1089,2072,2074],{"className":1091,"code":2073,"language":1093,"meta":1094,"style":1094},"int start = 0;\nint end = matchScores.length - 1;\nwhile (start \u003C end)\n{\n    double temp = matchScores[start];\n    matchScores[start] = matchScores[end];\n    matchScores[end] = temp;\n    start++;\n    end--;\n}\n\u002F\u002F matchScores is now: 40.0, 52.0, 45.5, 45.5, 38.0\n",[1096,2075,2076,2080,2085,2089,2093,2098,2103,2108,2112,2116,2120],{"__ignoreMap":1094},[1099,2077,2078],{"class":1101,"line":1102},[1099,2079,1552],{},[1099,2081,2082],{"class":1101,"line":1108},[1099,2083,2084],{},"int end = matchScores.length - 1;\n",[1099,2086,2087],{"class":1101,"line":1114},[1099,2088,1562],{},[1099,2090,2091],{"class":1101,"line":1120},[1099,2092,1117],{},[1099,2094,2095],{"class":1101,"line":1126},[1099,2096,2097],{},"    double temp = matchScores[start];\n",[1099,2099,2100],{"class":1101,"line":1132},[1099,2101,2102],{},"    matchScores[start] = matchScores[end];\n",[1099,2104,2105],{"class":1101,"line":1175},[1099,2106,2107],{},"    matchScores[end] = temp;\n",[1099,2109,2110],{"class":1101,"line":1181},[1099,2111,1586],{},[1099,2113,2114],{"class":1101,"line":1187},[1099,2115,1591],{},[1099,2117,2118],{"class":1101,"line":1243},[1099,2119,1129],{},[1099,2121,2122],{"class":1101,"line":1249},[1099,2123,2124],{},"\u002F\u002F matchScores is now: 40.0, 52.0, 45.5, 45.5, 38.0\n",[1084,2126,2128],{"id":2127},"recap","Recap",[1601,2130,2131,2133,2142,2144,2150],{},[1604,2132,1661],{},[1604,2134,2135,2136,2138,2139,2141],{},"Seeding ",[1096,2137,1804],{}," with the first element (not ",[1096,2140,1612],{},") avoids a wrong starting point if real values could be at or below zero.",[1604,2143,1664],{},[1604,2145,2146,2147,2149],{},"Adjacent-duplicate checks are a single loop, bounded by ",[1096,2148,1999],{}," so it never reads one past the end.",[1604,2151,1670],{},[1683,2153,1685],{},{"title":1094,"searchDepth":1108,"depth":1108,"links":2155},[2156,2157,2158,2159,2160,2161,2162,2163,2164],{"id":1712,"depth":1108,"text":1713},{"id":1719,"depth":1108,"text":1720},{"id":1756,"depth":1108,"text":1757},{"id":1797,"depth":1108,"text":1798},{"id":1859,"depth":1108,"text":1860},{"id":1936,"depth":1108,"text":1937},{"id":1985,"depth":1108,"text":1986},{"id":2066,"depth":1108,"text":2067},{"id":2127,"depth":1108,"text":2128},{"outlineRef":1699,"pairsWith":2166,"status":2167},"[`lessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md`](..\u002F..\u002Flessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md)","new — authored worked example (fully solved, walked step by step — not a problem to attempt)",{"title":595,"description":1094},"tA4TZC3jLpseFCS6ZtCMLFIkywffFrnNZlWRWB3qAZI",{"id":2171,"title":904,"body":2172,"description":1094,"extension":1697,"meta":2946,"navigation":1367,"path":903,"seo":2948,"stem":905,"__hash__":2949},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md",{"type":1073,"value":2173,"toc":2941},[2174,2177,2181,2187,2228,2233,2265,2271,2295,2313,2317,2342,2345,2407,2412,2522,2588,2592,2598,2626,2629,2653,2662,2667,2703,2708,2837,2842,2906,2939],[1076,2175,904],{"id":2176},"implementing-array-algorithms-exercises",[1084,2178,2180],{"id":2179},"multiple-choice","Multiple Choice",[1080,2182,2183,2186],{},[1607,2184,2185],{},"Question:"," A robot's climb times can legitimately include small negative corrections. What's the problem with this code, which is meant to find the fastest (minimum) climb time?",[1089,2188,2190],{"className":1091,"code":2189,"language":1093,"meta":1094,"style":1094},"double min = 0;\nfor (double time : climbTimes)\n{\n    if (time \u003C min)\n    {\n        min = time;\n    }\n}\n",[1096,2191,2192,2197,2202,2206,2211,2215,2220,2224],{"__ignoreMap":1094},[1099,2193,2194],{"class":1101,"line":1102},[1099,2195,2196],{},"double min = 0;\n",[1099,2198,2199],{"class":1101,"line":1108},[1099,2200,2201],{},"for (double time : climbTimes)\n",[1099,2203,2204],{"class":1101,"line":1114},[1099,2205,1117],{},[1099,2207,2208],{"class":1101,"line":1120},[1099,2209,2210],{},"    if (time \u003C min)\n",[1099,2212,2213],{"class":1101,"line":1126},[1099,2214,1172],{},[1099,2216,2217],{"class":1101,"line":1132},[1099,2218,2219],{},"        min = time;\n",[1099,2221,2222],{"class":1101,"line":1175},[1099,2223,1184],{},[1099,2225,2226],{"class":1101,"line":1181},[1099,2227,1129],{},[1080,2229,2230],{},[1607,2231,2232],{},"Options:",[1601,2234,2235,2245,2256,2262],{},[1604,2236,2237,2238,2241,2242,2244],{},"A. If every real climb time happens to be positive, ",[1096,2239,2240],{},"min"," stays ",[1096,2243,1612],{}," — a value that was never actually recorded",[1604,2246,2247,2248,2251,2252,2255],{},"B. ",[1096,2249,2250],{},"time \u003C min"," should be ",[1096,2253,2254],{},"time > min"," to find a minimum",[1604,2257,2258,2259],{},"C. This throws an ",[1096,2260,2261],{},"ArrayIndexOutOfBoundsException",[1604,2263,2264],{},"D. Nothing is wrong — this correctly finds the minimum",[1080,2266,2267,2270],{},[1607,2268,2269],{},"Answer:"," A",[1080,2272,2273,2276,2277,2279,2280,2282,2283,2285,2286,2288,2289,2279,2291,2294],{},[1607,2274,2275],{},"Why:"," Seeding ",[1096,2278,2240],{}," with ",[1096,2281,1612],{}," instead of the array's first real element is the classic min\u002Fmax pitfall — it only happens to give a correct answer when a value below ",[1096,2284,1612],{}," truly exists in the data. If every climb time is positive, the loop never finds anything smaller than the fake starting point of ",[1096,2287,1612],{},", so it reports a minimum that was never actually recorded. The fix is to seed ",[1096,2290,2240],{},[1096,2292,2293],{},"climbTimes[0]"," before the loop.",[1601,2296,2297,2304,2307],{},[1604,2298,2299,2300,2303],{},"B is wrong — ",[1096,2301,2302],{},"\u003C"," is the correct comparison for tracking a running minimum; flipping it would track a maximum instead.",[1604,2305,2306],{},"C is wrong — nothing here reads outside the array's bounds.",[1604,2308,2309,2310,2312],{},"D is wrong — this is exactly the \"seeding with ",[1096,2311,1612],{},"\" pitfall the lesson calls out; it only looks correct by coincidence.",[1084,2314,2316],{"id":2315},"micro-parsons","Micro-Parsons",[1080,2318,2319,2322,2323,2326,2327,2330,2331,2334,2335,2337,2338,2341],{},[1607,2320,2321],{},"Problem:"," Given a class with a ",[1096,2324,2325],{},"main"," method where ",[1096,2328,2329],{},"int[] channels"," already holds the radio channel numbers assigned to each subteam, and a ",[1096,2332,2333],{},"reportDuplicate()"," helper method that is already defined, reorder these fragments into the nested loop (inside ",[1096,2336,2325],{},") that checks every pair of channels (not just neighbors) and calls ",[1096,2339,2340],{},"reportDuplicate();"," the instant two channels match.",[1080,2343,2344],{},"Reorder the fragments below to complete it:",[1601,2346,2347,2353,2359,2365,2371,2377,2383,2389,2395,2401],{},[1604,2348,2349,2350],{},"a. ",[1096,2351,2352],{},"        for (int i = 0; i \u003C channels.length; i++)",[1604,2354,2355,2356],{},"b. ",[1096,2357,2358],{},"        {",[1604,2360,2361,2362],{},"c. ",[1096,2363,2364],{},"            for (int j = i + 1; j \u003C channels.length; j++)",[1604,2366,2367,2368],{},"d. ",[1096,2369,2370],{},"            {",[1604,2372,2373,2374],{},"e. ",[1096,2375,2376],{},"                if (channels[i] == channels[j])",[1604,2378,2379,2380],{},"f. ",[1096,2381,2382],{},"                {",[1604,2384,2385,2386],{},"g. ",[1096,2387,2388],{},"                    reportDuplicate();",[1604,2390,2391,2392],{},"h. ",[1096,2393,2394],{},"                }",[1604,2396,2397,2398],{},"i. ",[1096,2399,2400],{},"            }",[1604,2402,2403,2404],{},"j. ",[1096,2405,2406],{},"        }",[1080,2408,2409,2411],{},[1607,2410,2269],{}," a, b, c, d, e, f, g, h, i, j",[1089,2413,2415],{"className":1091,"code":2414,"language":1093,"meta":1094,"style":1094},"public class RadioChannelCheck\n{\n    public static void reportDuplicate()\n    {\n        System.out.println(\"Duplicate channel assignment detected!\");\n    }\n\n    public static void main(String[] args)\n    {\n        int[] channels = {10, 15, 22, 8, 15};\n\n        for (int i = 0; i \u003C channels.length; i++)\n        {\n            for (int j = i + 1; j \u003C channels.length; j++)\n            {\n                if (channels[i] == channels[j])\n                {\n                    reportDuplicate();\n                }\n            }\n        }\n    }\n}\n",[1096,2416,2417,2422,2426,2431,2435,2440,2444,2448,2453,2457,2462,2466,2471,2475,2480,2485,2490,2495,2500,2505,2510,2514,2518],{"__ignoreMap":1094},[1099,2418,2419],{"class":1101,"line":1102},[1099,2420,2421],{},"public class RadioChannelCheck\n",[1099,2423,2424],{"class":1101,"line":1108},[1099,2425,1117],{},[1099,2427,2428],{"class":1101,"line":1114},[1099,2429,2430],{},"    public static void reportDuplicate()\n",[1099,2432,2433],{"class":1101,"line":1120},[1099,2434,1172],{},[1099,2436,2437],{"class":1101,"line":1126},[1099,2438,2439],{},"        System.out.println(\"Duplicate channel assignment detected!\");\n",[1099,2441,2442],{"class":1101,"line":1132},[1099,2443,1184],{},[1099,2445,2446],{"class":1101,"line":1175},[1099,2447,1368],{"emptyLinePlaceholder":1367},[1099,2449,2450],{"class":1101,"line":1181},[1099,2451,2452],{},"    public static void main(String[] args)\n",[1099,2454,2455],{"class":1101,"line":1187},[1099,2456,1172],{},[1099,2458,2459],{"class":1101,"line":1243},[1099,2460,2461],{},"        int[] channels = {10, 15, 22, 8, 15};\n",[1099,2463,2464],{"class":1101,"line":1249},[1099,2465,1368],{"emptyLinePlaceholder":1367},[1099,2467,2468],{"class":1101,"line":1376},[1099,2469,2470],{},"        for (int i = 0; i \u003C channels.length; i++)\n",[1099,2472,2473],{"class":1101,"line":1381},[1099,2474,1226],{},[1099,2476,2477],{"class":1101,"line":1386},[1099,2478,2479],{},"            for (int j = i + 1; j \u003C channels.length; j++)\n",[1099,2481,2482],{"class":1101,"line":1392},[1099,2483,2484],{},"            {\n",[1099,2486,2487],{"class":1101,"line":1397},[1099,2488,2489],{},"                if (channels[i] == channels[j])\n",[1099,2491,2492],{"class":1101,"line":1403},[1099,2493,2494],{},"                {\n",[1099,2496,2497],{"class":1101,"line":1408},[1099,2498,2499],{},"                    reportDuplicate();\n",[1099,2501,2502],{"class":1101,"line":1413},[1099,2503,2504],{},"                }\n",[1099,2506,2507],{"class":1101,"line":1419},[1099,2508,2509],{},"            }\n",[1099,2511,2512],{"class":1101,"line":1424},[1099,2513,1236],{},[1099,2515,2516],{"class":1101,"line":1430},[1099,2517,1184],{},[1099,2519,2520],{"class":1101,"line":1436},[1099,2521,1129],{},[1080,2523,2524,2527,2528,2531,2532,2535,2536,2539,2540,2543,2544,2531,2547,2550,2551,2543,2554,2557,2558,2531,2561,2564,2565,2567,2568,2570,2571,2574,2575,2577,2578,2580,2581,2584,2585,2587],{},[1607,2525,2526],{},"Why this order:"," The outer loop (",[1096,2529,2530],{},"a",", ",[1096,2533,2534],{},"b",") has to exist before the inner loop can be nested inside it. The inner loop starts its ",[1096,2537,2538],{},"j"," index at ",[1096,2541,2542],{},"i + 1"," (",[1096,2545,2546],{},"c",[1096,2548,2549],{},"d",") so each pair is only checked once, rather than checking every element against itself and against pairs already covered. The ",[1096,2552,2553],{},"if",[1096,2555,2556],{},"e",") and its own braces (",[1096,2559,2560],{},"f",[1096,2562,2563],{},"h",") sit inside both loops so every pair gets examined. The braces close in reverse of how they opened — the ",[1096,2566,2553],{},"'s brace (",[1096,2569,2563],{},"), then the inner loop's brace (",[1096,2572,2573],{},"i","), then the outer loop's brace (",[1096,2576,2538],{},"). The class, ",[1096,2579,2333],{},", the ",[1096,2582,2583],{},"channels"," array, and ",[1096,2586,2325],{},"'s own braces are the given scaffold; only this nested loop needed reordering.",[1084,2589,2591],{"id":2590},"coding","Coding",[1080,2593,2594,2597],{},[1607,2595,2596],{},"Mode:"," harness",[1080,2599,2600,2602,2603,2606,2607,2610,2611,2614,2615,2618,2619,2622,2623,2625],{},[1607,2601,2321],{}," A sensor is \"stuck\" when it reports the same value twice in a row. Write ",[1096,2604,2605],{},"hasStuckReading",", which\nreturns ",[1096,2608,2609],{},"true"," if ",[1607,2612,2613],{},"any two neighbouring"," readings in the array are equal, and ",[1096,2616,2617],{},"false"," otherwise. Equal\nvalues that are ",[1271,2620,2621],{},"not"," next to each other don't count. An array with 0 or 1 readings has no neighbours, so the\nanswer is ",[1096,2624,2617],{},".",[1080,2627,2628],{},"Examples:",[1601,2630,2631,2639,2646],{},[1604,2632,2633,2636,2637],{},[1096,2634,2635],{},"hasStuckReading(new int[] {3, 5, 5, 8})"," returns ",[1096,2638,2609],{},[1604,2640,2641,2636,2644],{},[1096,2642,2643],{},"hasStuckReading(new int[] {3, 5, 3, 5})",[1096,2645,2617],{},[1604,2647,2648,2636,2651],{},[1096,2649,2650],{},"hasStuckReading(new int[] {4})",[1096,2652,2617],{},[1080,2654,2655,2658,2659],{},[1607,2656,2657],{},"Signature:"," ",[1096,2660,2661],{},"public static boolean hasStuckReading(int[] readings)",[1080,2663,2664],{},[1607,2665,2666],{},"Starter:",[1089,2668,2670],{"className":1091,"code":2669,"language":1093,"meta":1094,"style":1094},"public class Solution\n{\n    public static boolean hasStuckReading(int[] readings)\n    {\n        \u002F\u002F TODO: compare each reading with the one after it\n    }\n}\n",[1096,2671,2672,2677,2681,2686,2690,2695,2699],{"__ignoreMap":1094},[1099,2673,2674],{"class":1101,"line":1102},[1099,2675,2676],{},"public class Solution\n",[1099,2678,2679],{"class":1101,"line":1108},[1099,2680,1117],{},[1099,2682,2683],{"class":1101,"line":1114},[1099,2684,2685],{},"    public static boolean hasStuckReading(int[] readings)\n",[1099,2687,2688],{"class":1101,"line":1120},[1099,2689,1172],{},[1099,2691,2692],{"class":1101,"line":1126},[1099,2693,2694],{},"        \u002F\u002F TODO: compare each reading with the one after it\n",[1099,2696,2697],{"class":1101,"line":1132},[1099,2698,1184],{},[1099,2700,2701],{"class":1101,"line":1175},[1099,2702,1129],{},[1080,2704,2705],{},[1607,2706,2707],{},"Tests:",[2709,2710,2711,2727],"table",{},[2712,2713,2714],"thead",{},[2715,2716,2717,2721,2724],"tr",{},[2718,2719,2720],"th",{},"Visible",[2718,2722,2723],{},"Arguments",[2718,2725,2726],{},"Expected",[2728,2729,2730,2745,2758,2771,2785,2798,2811,2824],"tbody",{},[2715,2731,2732,2736,2741],{},[2733,2734,2735],"td",{},"yes",[2733,2737,2738],{},[1096,2739,2740],{},"new int[] {3, 5, 5, 8}",[2733,2742,2743],{},[1096,2744,2609],{},[2715,2746,2747,2749,2754],{},[2733,2748,2735],{},[2733,2750,2751],{},[1096,2752,2753],{},"new int[] {3, 5, 3, 5}",[2733,2755,2756],{},[1096,2757,2617],{},[2715,2759,2760,2762,2767],{},[2733,2761,2735],{},[2733,2763,2764],{},[1096,2765,2766],{},"new int[] {4}",[2733,2768,2769],{},[1096,2770,2617],{},[2715,2772,2773,2776,2781],{},[2733,2774,2775],{},"no",[2733,2777,2778],{},[1096,2779,2780],{},"new int[] {1, 2, 3, 3}",[2733,2782,2783],{},[1096,2784,2609],{},[2715,2786,2787,2789,2794],{},[2733,2788,2775],{},[2733,2790,2791],{},[1096,2792,2793],{},"new int[] {7, 7, 1, 2}",[2733,2795,2796],{},[1096,2797,2609],{},[2715,2799,2800,2802,2807],{},[2733,2801,2775],{},[2733,2803,2804],{},[1096,2805,2806],{},"new int[] {1, 2, 3, 4}",[2733,2808,2809],{},[1096,2810,2617],{},[2715,2812,2813,2815,2820],{},[2733,2814,2775],{},[2733,2816,2817],{},[1096,2818,2819],{},"new int[] {}",[2733,2821,2822],{},[1096,2823,2617],{},[2715,2825,2826,2828,2833],{},[2733,2827,2775],{},[2733,2829,2830],{},[1096,2831,2832],{},"new int[] {9, 9}",[2733,2834,2835],{},[1096,2836,2609],{},[1080,2838,2839],{},[1607,2840,2841],{},"Solution:",[1089,2843,2845],{"className":1091,"code":2844,"language":1093,"meta":1094,"style":1094},"public class Solution\n{\n    public static boolean hasStuckReading(int[] readings)\n    {\n        for (int i = 0; i \u003C readings.length - 1; i++)\n        {\n            if (readings[i] == readings[i + 1])\n            {\n                return true;\n            }\n        }\n        return false;\n    }\n}\n",[1096,2846,2847,2851,2855,2859,2863,2868,2872,2877,2881,2886,2890,2894,2898,2902],{"__ignoreMap":1094},[1099,2848,2849],{"class":1101,"line":1102},[1099,2850,2676],{},[1099,2852,2853],{"class":1101,"line":1108},[1099,2854,1117],{},[1099,2856,2857],{"class":1101,"line":1114},[1099,2858,2685],{},[1099,2860,2861],{"class":1101,"line":1120},[1099,2862,1172],{},[1099,2864,2865],{"class":1101,"line":1126},[1099,2866,2867],{},"        for (int i = 0; i \u003C readings.length - 1; i++)\n",[1099,2869,2870],{"class":1101,"line":1132},[1099,2871,1226],{},[1099,2873,2874],{"class":1101,"line":1175},[1099,2875,2876],{},"            if (readings[i] == readings[i + 1])\n",[1099,2878,2879],{"class":1101,"line":1181},[1099,2880,2484],{},[1099,2882,2883],{"class":1101,"line":1187},[1099,2884,2885],{},"                return true;\n",[1099,2887,2888],{"class":1101,"line":1243},[1099,2889,2509],{},[1099,2891,2892],{"class":1101,"line":1249},[1099,2893,1236],{},[1099,2895,2896],{"class":1101,"line":1376},[1099,2897,1400],{},[1099,2899,2900],{"class":1101,"line":1381},[1099,2901,1184],{},[1099,2903,2904],{"class":1101,"line":1386},[1099,2905,1129],{},[1080,2907,2908,2910,2911,2279,2914,2917,2918,2921,2922,2925,2926,2929,2930,2932,2933,2935,2936,2938],{},[1607,2909,2275],{}," Each pass compares ",[1096,2912,2913],{},"readings[i]",[1096,2915,2916],{},"readings[i + 1]",", so the loop has to stop at\n",[1096,2919,2920],{},"readings.length - 2",", which is what ",[1096,2923,2924],{},"i \u003C readings.length - 1"," does. Looping all the way to\n",[1096,2927,2928],{},"readings.length - 1"," reads one past the end and throws ",[1096,2931,2261],{}," whenever no pair\nmatches earlier. Only a match returns early (",[1096,2934,2609],{},"); ",[1096,2937,2617],{}," waits until every neighbouring pair has been\nchecked.",[1683,2940,1685],{},{"title":1094,"searchDepth":1108,"depth":1108,"links":2942},[2943,2944,2945],{"id":2179,"depth":1108,"text":2180},{"id":2315,"depth":1108,"text":2316},{"id":2590,"depth":1108,"text":2591},{"outlineRef":1699,"pairsWith":2166,"status":2947},"new — authored exercises (Multiple Choice + Micro-Parsons + Coding)",{"title":904,"description":1094},"1QpMLxkcW9iP8z_lnzjF6FYnOiedX7fg-py56SUlvzE",1792718165933]