[{"data":1,"prerenderedAt":2098},["ShallowReactive",2],{"item-lessons-light-ch09-storing-data":3,"item-examples-light-ch09-storing-data":436,"item-exercises-light-ch09-storing-data":597,"item-lesson-full-ch09-storing-data-9.5":758,"item-example-full-ch09-storing-data-9.5":1255,"item-exercise-full-ch09-storing-data-9.5":1709},[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],{"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 & 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\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":85,"title":86,"stem":87},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":89,"title":90,"stem":91},"\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":93,"title":94,"stem":95},"\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":97,"title":98,"stem":99},"\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":101,"title":102,"stem":103},"\u002Fshockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F8-while-loops","While Loops","shockwave-curriculum\u002Flessons\u002Fch05-control-structures\u002F5.8-while-loops",{"path":105,"title":106,"stem":107},"\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":109,"title":110,"stem":111},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F1-strings","Strings","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.1-strings",{"path":113,"title":114,"stem":115},"\u002Fshockwave-curriculum\u002Flessons\u002Fch06-strings\u002F2-string-algorithms","String Algorithms","shockwave-curriculum\u002Flessons\u002Fch06-strings\u002F6.2-string-algorithms",{"path":117,"title":118,"stem":119},"\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":121,"title":122,"stem":123},"\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":125,"title":126,"stem":127},"\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":129,"title":130,"stem":131},"\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":133,"title":134,"stem":135},"\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":137,"title":138,"stem":139},"\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":141,"title":142,"stem":143},"\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":145,"title":146,"stem":147},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","Optional: HashMap (Dictionary) Data Structure","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":149,"title":150,"stem":151},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":153,"title":154,"stem":155},"\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":157,"title":158,"stem":159},"\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals","shockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":161,"title":162,"stem":163},"\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":165,"title":166,"stem":167},"\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":169,"title":170,"stem":171},"\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":173,"title":174,"stem":175},"\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":177,"title":178,"stem":179},"\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":181,"title":182,"stem":183},"\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":185,"title":186,"stem":187},"\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":189,"title":190,"stem":191},"\u002Fshockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas","Common Gotchas","shockwave-curriculum\u002Flessons\u002Fch13-common-gotchas\u002F13-common-gotchas",{"path":193,"title":194,"stem":195},"\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":197,"title":198,"stem":199},"\u002Fshockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections","Advanced Collections (Set\u002FQueue\u002FMap)","shockwave-curriculum\u002Flessons\u002Fch15-advanced-collections\u002F15-advanced-collections",{"path":201,"title":202,"stem":203},"\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":205,"title":206,"stem":207},"\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":209,"title":210,"stem":211},"\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":213,"title":214,"stem":215},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F3-inheritance-hierarchies","Inheritance Hierarchies","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.3-inheritance-hierarchies",{"path":217,"title":218,"stem":219},"\u002Fshockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F4-object-superclass","Object Superclass","shockwave-curriculum\u002Flessons\u002Fch17-inheritance-and-abstractions\u002F17.4-object-superclass",{"path":221,"title":222,"stem":223},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F1-overriding-methods","Overriding Methods","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.1-overriding-methods",{"path":225,"title":226,"stem":227},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F2-super-keyword","super Keyword","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.2-super-keyword",{"path":229,"title":230,"stem":231},"\u002Fshockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F3-polymorphism","Polymorphism","shockwave-curriculum\u002Flessons\u002Fch18-polymorphism-many-forms\u002F18.3-polymorphism",{"path":233,"title":234,"stem":235},"\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":237,"title":238,"stem":239},"\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":241,"title":242,"stem":243},"\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":245,"title":246,"stem":247},"\u002Fshockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories","Static Factories","shockwave-curriculum\u002Flessons\u002Fch21-static-factories\u002F21-static-factories",{"path":249,"title":250,"stem":251},"\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":253,"title":254,"stem":255},"\u002Fshockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F1-scope-and-access","Scope and Access","shockwave-curriculum\u002Flessons\u002Fch23-encapsulation-and-final\u002F23.1-scope-and-access",{"path":257,"title":258,"stem":259},"\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":261,"title":262,"stem":263},"\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":265,"title":266,"stem":267},"\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":269,"title":270,"stem":271},"\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":273,"title":274,"stem":275},"\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":277,"title":278,"stem":279},"\u002Fshockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F5-managing-transitions","Managing Transitions","shockwave-curriculum\u002Flessons\u002Fch25-command-based-programming\u002F25.5-managing-transitions",{"path":281,"title":282,"stem":283},"\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":285,"title":286,"stem":287},"\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":289,"title":290,"stem":291},"\u002Fshockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways","Architecture Takeaways","shockwave-curriculum\u002Flessons\u002Fch26-architecture-takeaways\u002F26-architecture-takeaways",{"path":293,"title":294,"stem":295},"\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":297,"title":298,"stem":299},"\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":301,"title":302,"stem":303},"\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":305,"title":306,"stem":307},"\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":309,"title":310,"stem":311},"\u002Fshockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F3-recursion","Recursion","shockwave-curriculum\u002Flessons\u002Fch28-algorithms-searching-sorting-recursion\u002F28.3-recursion",{"path":313,"title":314,"stem":315},"\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":317,"title":318,"stem":319},"\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":321,"title":322,"stem":323},"\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":325,"title":326,"stem":327},"\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":329,"title":330,"stem":331},"\u002Fshockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F1-coming-soon","Unit Testing — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch32-unit-testing\u002F32.1-coming-soon",{"path":333,"title":334,"stem":335},"\u002Fshockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F1-coming-soon","AdvantageKit — AutoLogging — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch33-advantagekit-autologging\u002F33.1-coming-soon",{"path":337,"title":338,"stem":339},"\u002Fshockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F1-coming-soon","Log Replay — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch34-log-replay\u002F34.1-coming-soon",{"path":341,"title":342,"stem":343},"\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":345,"title":346,"stem":347},"\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":349,"title":350,"stem":351},"\u002Fshockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F1-coming-soon","Autonomous I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch37-autonomous-i\u002F37.1-coming-soon",{"path":353,"title":354,"stem":355},"\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":357,"title":358,"stem":359},"\u002Fshockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F1-coming-soon","Control Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch39-control-fundamentals\u002F39.1-coming-soon",{"path":361,"title":362,"stem":363},"\u002Fshockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F1-coming-soon","Motion Profiles — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch40-motion-profiles\u002F40.1-coming-soon",{"path":365,"title":366,"stem":367},"\u002Fshockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F1-coming-soon","Hardware Fundamentals — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch41-hardware-fundamentals\u002F41.1-coming-soon",{"path":369,"title":370,"stem":371},"\u002Fshockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F1-coming-soon","PhotonVision — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch42-photonvision\u002F42.1-coming-soon",{"path":373,"title":374,"stem":375},"\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":377,"title":378,"stem":379},"\u002Fshockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F1-coming-soon","Subsystems I — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch44-subsystems-i\u002F44.1-coming-soon",{"path":381,"title":382,"stem":383},"\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":385,"title":386,"stem":387},"\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":389,"title":390,"stem":391},"\u002Fshockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F1-coming-soon","Field Constants — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch47-field-constants\u002F47.1-coming-soon",{"path":393,"title":394,"stem":395},"\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":397,"title":398,"stem":399},"\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":401,"title":402,"stem":403},"\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":405,"title":406,"stem":407},"\u002Fshockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F1-coming-soon","Robot Alerts — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch51-robot-alerts\u002F51.1-coming-soon",{"path":409,"title":410,"stem":411},"\u002Fshockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F1-coming-soon","WPILib Commands — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch52-wpilib-commands\u002F52.1-coming-soon",{"path":413,"title":414,"stem":415},"\u002Fshockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F1-coming-soon","WPILib Geometry — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch53-wpilib-geometry\u002F53.1-coming-soon",{"path":417,"title":418,"stem":419},"\u002Fshockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F1-coming-soon","NetworkTables — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch54-networktables\u002F54.1-coming-soon",{"path":421,"title":422,"stem":423},"\u002Fshockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F1-coming-soon","Command Scheduler — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch55-command-scheduler\u002F55.1-coming-soon",{"path":425,"title":426,"stem":427},"\u002Fshockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F1-coming-soon","WPILib Timers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch56-wpilib-timers\u002F56.1-coming-soon",{"path":429,"title":430,"stem":431},"\u002Fshockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F1-coming-soon","WPILib Triggers — Coming Soon","shockwave-curriculum\u002Flessons\u002Fch57-wpilib-triggers\u002F57.1-coming-soon",{"path":433,"title":434,"stem":435},"\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",[437,441,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],{"path":438,"title":439,"stem":440},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming & Compilers — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":442,"title":443,"stem":444},"\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":446,"title":447,"stem":448},"\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":450,"title":451,"stem":452},"\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":454,"title":455,"stem":456},"\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":458,"title":459,"stem":460},"\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":462,"title":463,"stem":464},"\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":466,"title":467,"stem":468},"\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":470,"title":471,"stem":472},"\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":474,"title":475,"stem":476},"\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":478,"title":479,"stem":480},"\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":482,"title":483,"stem":484},"\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":486,"title":487,"stem":488},"\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":490,"title":491,"stem":492},"\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":494,"title":495,"stem":496},"\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":498,"title":499,"stem":500},"\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":502,"title":503,"stem":504},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":506,"title":507,"stem":508},"\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":510,"title":511,"stem":512},"\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":514,"title":515,"stem":516},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":518,"title":519,"stem":520},"\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":522,"title":523,"stem":524},"\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":526,"title":527,"stem":528},"\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":530,"title":531,"stem":532},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F8-while-loops","While Loops — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch05-control-structures\u002F5.8-while-loops",{"path":534,"title":535,"stem":536},"\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":538,"title":539,"stem":540},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F1-strings","Strings — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.1-strings",{"path":542,"title":543,"stem":544},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch06-strings\u002F6.2-string-algorithms",{"path":546,"title":547,"stem":548},"\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":550,"title":551,"stem":552},"\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":554,"title":555,"stem":556},"\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":558,"title":559,"stem":560},"\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":562,"title":563,"stem":564},"\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":566,"title":567,"stem":568},"\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":570,"title":571,"stem":572},"\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":574,"title":575,"stem":576},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","Optional: HashMap (Dictionary) Data Structure — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":578,"title":579,"stem":580},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":582,"title":583,"stem":584},"\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":586,"title":587,"stem":588},"\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Worked Example","shockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":590,"title":591,"stem":592},"\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":594,"title":595,"stem":596},"\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",[598,602,606,610,614,618,622,626,630,634,638,642,646,650,654,658,662,666,670,674,678,682,686,690,694,698,702,706,710,714,718,722,726,730,734,738,742,746,750,754],{"path":599,"title":600,"stem":601},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F2-intro-to-algorithms-programming-and-compilers","Intro to Algorithms, Programming & Compilers — Exercises","shockwave-curriculum\u002Fexercises\u002Fch01-why-java-for-frc\u002F1.2-intro-to-algorithms-programming-and-compilers",{"path":603,"title":604,"stem":605},"\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":607,"title":608,"stem":609},"\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":611,"title":612,"stem":613},"\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":615,"title":616,"stem":617},"\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":619,"title":620,"stem":621},"\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":623,"title":624,"stem":625},"\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":627,"title":628,"stem":629},"\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":631,"title":632,"stem":633},"\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":635,"title":636,"stem":637},"\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":639,"title":640,"stem":641},"\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":643,"title":644,"stem":645},"\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":647,"title":648,"stem":649},"\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":651,"title":652,"stem":653},"\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":655,"title":656,"stem":657},"\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":659,"title":660,"stem":661},"\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":663,"title":664,"stem":665},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F10-nested-iteration","Nested Iteration — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.10-nested-iteration",{"path":667,"title":668,"stem":669},"\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":671,"title":672,"stem":673},"\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":675,"title":676,"stem":677},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F4-boolean-expressions","Boolean Expressions — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.4-boolean-expressions",{"path":679,"title":680,"stem":681},"\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":683,"title":684,"stem":685},"\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":687,"title":688,"stem":689},"\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":691,"title":692,"stem":693},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F8-while-loops","While Loops — Exercises","shockwave-curriculum\u002Fexercises\u002Fch05-control-structures\u002F5.8-while-loops",{"path":695,"title":696,"stem":697},"\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":699,"title":700,"stem":701},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F1-strings","Strings — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.1-strings",{"path":703,"title":704,"stem":705},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F2-string-algorithms","String Algorithms — Exercises","shockwave-curriculum\u002Fexercises\u002Fch06-strings\u002F6.2-string-algorithms",{"path":707,"title":708,"stem":709},"\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":711,"title":712,"stem":713},"\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":715,"title":716,"stem":717},"\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":719,"title":720,"stem":721},"\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":723,"title":724,"stem":725},"\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":727,"title":728,"stem":729},"\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":731,"title":732,"stem":733},"\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":735,"title":736,"stem":737},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F3-optional-hashmap-dictionary-data-structure","Optional: HashMap (Dictionary) Data Structure — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.3-optional-hashmap-dictionary-data-structure",{"path":739,"title":740,"stem":741},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F4-array-traversals","Array Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.4-array-traversals",{"path":743,"title":744,"stem":745},"\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":747,"title":748,"stem":749},"\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F6-arraylist-traversals","ArrayList Traversals — Exercises","shockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.6-arraylist-traversals",{"path":751,"title":752,"stem":753},"\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":755,"title":756,"stem":757},"\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",{"id":759,"title":154,"body":760,"description":770,"extension":1249,"meta":1250,"navigation":993,"path":153,"seo":1253,"stem":155,"__hash__":1254},"lessons\u002Fshockwave-curriculum\u002Flessons\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md",{"type":761,"value":762,"toc":1238},"minimark",[763,767,771,776,824,828,872,876,935,939,942,965,969,1029,1033,1036,1059,1062,1098,1102,1150,1154,1205,1209,1223,1234],[764,765,154],"h1",{"id":766},"implementing-array-algorithms",[768,769,770],"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.",[772,773,775],"h2",{"id":774},"sum-average-accumulator","Sum \u002F Average (Accumulator)",[777,778,783],"pre",{"className":779,"code":780,"language":781,"meta":782,"style":782},"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","",[784,785,786,794,800,806,812,818],"code",{"__ignoreMap":782},[787,788,791],"span",{"class":789,"line":790},"line",1,[787,792,793],{},"double sum = 0;\n",[787,795,797],{"class":789,"line":796},2,[787,798,799],{},"for (double reading : sensorReadings)\n",[787,801,803],{"class":789,"line":802},3,[787,804,805],{},"{\n",[787,807,809],{"class":789,"line":808},4,[787,810,811],{},"    sum += reading;\n",[787,813,815],{"class":789,"line":814},5,[787,816,817],{},"}\n",[787,819,821],{"class":789,"line":820},6,[787,822,823],{},"double average = sum \u002F sensorReadings.length;\n",[772,825,827],{"id":826},"min-max","Min \u002F Max",[777,829,831],{"className":779,"code":830,"language":781,"meta":782,"style":782},"double max = sensorReadings[0]; \u002F\u002F seed with the first element, not 0 — a reading could be negative\nfor (double reading : sensorReadings)\n{\n    if (reading > max)\n    {\n        max = reading;\n    }\n}\n",[784,832,833,838,842,846,851,856,861,867],{"__ignoreMap":782},[787,834,835],{"class":789,"line":790},[787,836,837],{},"double max = sensorReadings[0]; \u002F\u002F seed with the first element, not 0 — a reading could be negative\n",[787,839,840],{"class":789,"line":796},[787,841,799],{},[787,843,844],{"class":789,"line":802},[787,845,805],{},[787,847,848],{"class":789,"line":808},[787,849,850],{},"    if (reading > max)\n",[787,852,853],{"class":789,"line":814},[787,854,855],{},"    {\n",[787,857,858],{"class":789,"line":820},[787,859,860],{},"        max = reading;\n",[787,862,864],{"class":789,"line":863},7,[787,865,866],{},"    }\n",[787,868,870],{"class":789,"line":869},8,[787,871,817],{},[772,873,875],{"id":874},"search-check-everything-before-giving-up","Search — Check Everything Before Giving Up",[777,877,879],{"className":779,"code":878,"language":781,"meta":782,"style":782},"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",[784,880,881,886,890,895,899,904,909,914,919,924,930],{"__ignoreMap":782},[787,882,883],{"class":789,"line":790},[787,884,885],{},"public static boolean contains(double[] values, double target)\n",[787,887,888],{"class":789,"line":796},[787,889,805],{},[787,891,892],{"class":789,"line":802},[787,893,894],{},"    for (double v : values)\n",[787,896,897],{"class":789,"line":808},[787,898,855],{},[787,900,901],{"class":789,"line":814},[787,902,903],{},"        if (v == target)\n",[787,905,906],{"class":789,"line":820},[787,907,908],{},"        {\n",[787,910,911],{"class":789,"line":863},[787,912,913],{},"            return true; \u002F\u002F fine to return early on a MATCH\n",[787,915,916],{"class":789,"line":869},[787,917,918],{},"        }\n",[787,920,922],{"class":789,"line":921},9,[787,923,866],{},[787,925,927],{"class":789,"line":926},10,[787,928,929],{},"    return false; \u002F\u002F only after checking every element\n",[787,931,933],{"class":789,"line":932},11,[787,934,817],{},[772,936,938],{"id":937},"looping-back-to-front","Looping Back to Front",[768,940,941],{},"Same shape, just counting down:",[777,943,945],{"className":779,"code":944,"language":781,"meta":782,"style":782},"for (int i = values.length - 1; i >= 0; i--)\n{\n    \u002F\u002F process values[i], starting from the end\n}\n",[784,946,947,952,956,961],{"__ignoreMap":782},[787,948,949],{"class":789,"line":790},[787,950,951],{},"for (int i = values.length - 1; i >= 0; i--)\n",[787,953,954],{"class":789,"line":796},[787,955,805],{},[787,957,958],{"class":789,"line":802},[787,959,960],{},"    \u002F\u002F process values[i], starting from the end\n",[787,962,963],{"class":789,"line":808},[787,964,817],{},[772,966,968],{"id":967},"at-least-one-all-count","\"At Least One\" \u002F \"All\" \u002F \"Count\"",[777,970,972],{"className":779,"code":971,"language":781,"meta":782,"style":782},"\u002F\u002F at least one has the property\nfor (double v : values) { if (isFaulty(v)) return true; }\nreturn false;\n\n\u002F\u002F all have the property (check the NEGATION, bail early on a counter-example)\nfor (double v : values) { if (!isFaulty(v)) return false; }\nreturn true;\n\n\u002F\u002F count how many have the property\nint count = 0;\nfor (double v : values) { if (isFaulty(v)) count++; }\n",[784,973,974,979,984,989,995,1000,1005,1010,1014,1019,1024],{"__ignoreMap":782},[787,975,976],{"class":789,"line":790},[787,977,978],{},"\u002F\u002F at least one has the property\n",[787,980,981],{"class":789,"line":796},[787,982,983],{},"for (double v : values) { if (isFaulty(v)) return true; }\n",[787,985,986],{"class":789,"line":802},[787,987,988],{},"return false;\n",[787,990,991],{"class":789,"line":808},[787,992,994],{"emptyLinePlaceholder":993},true,"\n",[787,996,997],{"class":789,"line":814},[787,998,999],{},"\u002F\u002F all have the property (check the NEGATION, bail early on a counter-example)\n",[787,1001,1002],{"class":789,"line":820},[787,1003,1004],{},"for (double v : values) { if (!isFaulty(v)) return false; }\n",[787,1006,1007],{"class":789,"line":863},[787,1008,1009],{},"return true;\n",[787,1011,1012],{"class":789,"line":869},[787,1013,994],{"emptyLinePlaceholder":993},[787,1015,1016],{"class":789,"line":921},[787,1017,1018],{},"\u002F\u002F count how many have the property\n",[787,1020,1021],{"class":789,"line":926},[787,1022,1023],{},"int count = 0;\n",[787,1025,1026],{"class":789,"line":932},[787,1027,1028],{},"for (double v : values) { if (isFaulty(v)) count++; }\n",[772,1030,1032],{"id":1031},"duplicates","Duplicates",[768,1034,1035],{},"Adjacent only — a single loop comparing neighbors:",[777,1037,1039],{"className":779,"code":1038,"language":781,"meta":782,"style":782},"for (int i = 0; i \u003C values.length - 1; i++)\n{\n    if (values[i] == values[i + 1]) return true;\n}\n",[784,1040,1041,1046,1050,1055],{"__ignoreMap":782},[787,1042,1043],{"class":789,"line":790},[787,1044,1045],{},"for (int i = 0; i \u003C values.length - 1; i++)\n",[787,1047,1048],{"class":789,"line":796},[787,1049,805],{},[787,1051,1052],{"class":789,"line":802},[787,1053,1054],{},"    if (values[i] == values[i + 1]) return true;\n",[787,1056,1057],{"class":789,"line":808},[787,1058,817],{},[768,1060,1061],{},"Anywhere in the array — a nested loop comparing every pair:",[777,1063,1065],{"className":779,"code":1064,"language":781,"meta":782,"style":782},"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",[784,1066,1067,1072,1076,1081,1085,1090,1094],{"__ignoreMap":782},[787,1068,1069],{"class":789,"line":790},[787,1070,1071],{},"for (int i = 0; i \u003C values.length; i++)\n",[787,1073,1074],{"class":789,"line":796},[787,1075,805],{},[787,1077,1078],{"class":789,"line":802},[787,1079,1080],{},"    for (int j = i + 1; j \u003C values.length; j++)\n",[787,1082,1083],{"class":789,"line":808},[787,1084,855],{},[787,1086,1087],{"class":789,"line":814},[787,1088,1089],{},"        if (values[i] == values[j]) return true;\n",[787,1091,1092],{"class":789,"line":820},[787,1093,866],{},[787,1095,1096],{"class":789,"line":863},[787,1097,817],{},[772,1099,1101],{"id":1100},"reversing-swap-from-both-ends","Reversing (Swap From Both Ends)",[777,1103,1105],{"className":779,"code":1104,"language":781,"meta":782,"style":782},"int start = 0, 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",[784,1106,1107,1112,1117,1121,1126,1131,1136,1141,1146],{"__ignoreMap":782},[787,1108,1109],{"class":789,"line":790},[787,1110,1111],{},"int start = 0, end = values.length - 1;\n",[787,1113,1114],{"class":789,"line":796},[787,1115,1116],{},"while (start \u003C end)\n",[787,1118,1119],{"class":789,"line":802},[787,1120,805],{},[787,1122,1123],{"class":789,"line":808},[787,1124,1125],{},"    double temp = values[start];\n",[787,1127,1128],{"class":789,"line":814},[787,1129,1130],{},"    values[start] = values[end];\n",[787,1132,1133],{"class":789,"line":820},[787,1134,1135],{},"    values[end] = temp;\n",[787,1137,1138],{"class":789,"line":863},[787,1139,1140],{},"    start++;\n",[787,1142,1143],{"class":789,"line":869},[787,1144,1145],{},"    end--;\n",[787,1147,1148],{"class":789,"line":921},[787,1149,817],{},[772,1151,1153],{"id":1152},"common-pitfalls","Common Pitfalls",[1155,1156,1157,1172,1183],"ul",{},[1158,1159,1160,1168,1169,1171],"li",{},[1161,1162,1163,1164,1167],"strong",{},"Seeding min\u002Fmax with ",[784,1165,1166],{},"0"," instead of the first element."," If every real value is negative (or all above some baseline), ",[784,1170,1166],{}," is a wrong starting point that never gets replaced correctly.",[1158,1173,1174,1177,1178,1182],{},[1161,1175,1176],{},"Returning \"not found\" from inside the loop."," Only a ",[1179,1180,1181],"em",{},"match"," should return early; \"not found\" has to wait until the loop has checked every element.",[1158,1184,1185,1196,1197,1200,1201,1204],{},[1161,1186,1187,1188,1191,1192,1195],{},"Comparing ",[784,1189,1190],{},"values[i]"," to ",[784,1193,1194],{},"values[i+1]"," all the way to the last index."," This reads one past the end — the adjacent-duplicate loop must stop at ",[784,1198,1199],{},"length - 2"," (i.e., bound the loop by ",[784,1202,1203],{},"i \u003C values.length - 1",").",[772,1206,1208],{"id":1207},"key-takeaways","Key Takeaways",[1155,1210,1211,1214,1217,1220],{},[1158,1212,1213],{},"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).",[1158,1215,1216],{},"A search for \"not found\" must check every element before concluding absence; a search for a match can return the instant it's found.",[1158,1218,1219],{},"Adjacent-duplicate checks are a single loop; any-pair duplicate checks need a nested loop.",[1158,1221,1222],{},"Reversing in place swaps from both ends toward the middle using a temporary variable.",[768,1224,1225,1226,1229,1230,1233],{},"Derived from ",[784,1227,1228],{},"csawesome-2026",": ",[784,1231,1232],{},"unit-4-data-collections\u002F4.05-implementing-array-algorithms.md"," (CSA 4.5)",[1235,1236,1237],"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":782,"searchDepth":796,"depth":796,"links":1239},[1240,1241,1242,1243,1244,1245,1246,1247,1248],{"id":774,"depth":796,"text":775},{"id":826,"depth":796,"text":827},{"id":874,"depth":796,"text":875},{"id":937,"depth":796,"text":938},{"id":967,"depth":796,"text":968},{"id":1031,"depth":796,"text":1032},{"id":1100,"depth":796,"text":1101},{"id":1152,"depth":796,"text":1153},{"id":1207,"depth":796,"text":1208},"md",{"outlineRef":1251,"status":1252},"9.5 — Implementing Array Algorithms (CSA 4.5)","new — authored lesson (fuller depth than the teaser slide)",{"title":154,"description":770},"Mx3A3iaAUCneBTjSB0a3F1nGnX_ubuOpPCTdKG1jwbc",{"id":1256,"title":583,"body":1257,"description":782,"extension":1249,"meta":1704,"navigation":993,"path":582,"seo":1707,"stem":584,"__hash__":1708},"examples\u002Fshockwave-curriculum\u002Fexamples\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md",{"type":761,"value":1258,"toc":1693},[1259,1262,1266,1269,1273,1276,1297,1306,1310,1347,1351,1364,1409,1413,1416,1468,1477,1481,1526,1530,1544,1598,1607,1611,1614,1664,1668,1691],[764,1260,583],{"id":1261},"implementing-array-algorithms-worked-example",[772,1263,1265],{"id":1264},"problem","Problem",[768,1267,1268],{},"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.",[772,1270,1272],{"id":1271},"step-1-plan-it-first","Step 1: Plan It First",[768,1274,1275],{},"Six small tasks, each one of the standard array-algorithm patterns:",[1277,1278,1279,1282,1285,1288,1291,1294],"ol",{},[1158,1280,1281],{},"Average — accumulator.",[1158,1283,1284],{},"Highest score — running max.",[1158,1286,1287],{},"Ever scored exactly 100 — search.",[1158,1289,1290],{},"Count of matches at or above 40 — property count.",[1158,1292,1293],{},"Two matches in a row with the same score — adjacent duplicates.",[1158,1295,1296],{},"Most-recent-first order — reverse in place.",[777,1298,1300],{"className":779,"code":1299,"language":781,"meta":782,"style":782},"double[] matchScores = {38.0, 45.5, 45.5, 52.0, 40.0};\n",[784,1301,1302],{"__ignoreMap":782},[787,1303,1304],{"class":789,"line":790},[787,1305,1299],{},[772,1307,1309],{"id":1308},"step-2-average-accumulator","Step 2: Average (Accumulator)",[777,1311,1313],{"className":779,"code":1312,"language":781,"meta":782,"style":782},"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",[784,1314,1315,1319,1324,1328,1333,1337,1342],{"__ignoreMap":782},[787,1316,1317],{"class":789,"line":790},[787,1318,793],{},[787,1320,1321],{"class":789,"line":796},[787,1322,1323],{},"for (double score : matchScores)\n",[787,1325,1326],{"class":789,"line":802},[787,1327,805],{},[787,1329,1330],{"class":789,"line":808},[787,1331,1332],{},"    sum += score;\n",[787,1334,1335],{"class":789,"line":814},[787,1336,817],{},[787,1338,1339],{"class":789,"line":820},[787,1340,1341],{},"double average = sum \u002F matchScores.length;\n",[787,1343,1344],{"class":789,"line":863},[787,1345,1346],{},"System.out.println(average); \u002F\u002F 44.2\n",[772,1348,1350],{"id":1349},"step-3-highest-score-running-max","Step 3: Highest Score (Running Max)",[768,1352,1353,1354,1357,1358,1360,1361,1363],{},"Seed ",[784,1355,1356],{},"max"," with the first element, not ",[784,1359,1166],{}," — a score could theoretically be recorded as a negative correction, and ",[784,1362,1166],{}," isn't guaranteed to be a real lower bound:",[777,1365,1367],{"className":779,"code":1366,"language":781,"meta":782,"style":782},"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",[784,1368,1369,1374,1378,1382,1387,1391,1396,1400,1404],{"__ignoreMap":782},[787,1370,1371],{"class":789,"line":790},[787,1372,1373],{},"double max = matchScores[0];\n",[787,1375,1376],{"class":789,"line":796},[787,1377,1323],{},[787,1379,1380],{"class":789,"line":802},[787,1381,805],{},[787,1383,1384],{"class":789,"line":808},[787,1385,1386],{},"    if (score > max)\n",[787,1388,1389],{"class":789,"line":814},[787,1390,855],{},[787,1392,1393],{"class":789,"line":820},[787,1394,1395],{},"        max = score;\n",[787,1397,1398],{"class":789,"line":863},[787,1399,866],{},[787,1401,1402],{"class":789,"line":869},[787,1403,817],{},[787,1405,1406],{"class":789,"line":921},[787,1407,1408],{},"System.out.println(max); \u002F\u002F 52.0\n",[772,1410,1412],{"id":1411},"step-4-ever-scored-exactly-100-search","Step 4: Ever Scored Exactly 100 (Search)",[768,1414,1415],{},"A match should return the instant it's found — but \"not found\" can only be concluded after every element has been checked:",[777,1417,1419],{"className":779,"code":1418,"language":781,"meta":782,"style":782},"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",[784,1420,1421,1426,1430,1435,1439,1444,1448,1452,1456,1460,1464],{"__ignoreMap":782},[787,1422,1423],{"class":789,"line":790},[787,1424,1425],{},"public static boolean everScored(double[] scores, double target)\n",[787,1427,1428],{"class":789,"line":796},[787,1429,805],{},[787,1431,1432],{"class":789,"line":802},[787,1433,1434],{},"    for (double score : scores)\n",[787,1436,1437],{"class":789,"line":808},[787,1438,855],{},[787,1440,1441],{"class":789,"line":814},[787,1442,1443],{},"        if (score == target)\n",[787,1445,1446],{"class":789,"line":820},[787,1447,908],{},[787,1449,1450],{"class":789,"line":863},[787,1451,913],{},[787,1453,1454],{"class":789,"line":869},[787,1455,918],{},[787,1457,1458],{"class":789,"line":921},[787,1459,866],{},[787,1461,1462],{"class":789,"line":926},[787,1463,929],{},[787,1465,1466],{"class":789,"line":932},[787,1467,817],{},[777,1469,1471],{"className":779,"code":1470,"language":781,"meta":782,"style":782},"System.out.println(everScored(matchScores, 100.0)); \u002F\u002F false\n",[784,1472,1473],{"__ignoreMap":782},[787,1474,1475],{"class":789,"line":790},[787,1476,1470],{},[772,1478,1480],{"id":1479},"step-5-count-of-matches-at-or-above-40-property-count","Step 5: Count of Matches at or Above 40 (Property Count)",[777,1482,1484],{"className":779,"code":1483,"language":781,"meta":782,"style":782},"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",[784,1485,1486,1491,1495,1499,1504,1508,1513,1517,1521],{"__ignoreMap":782},[787,1487,1488],{"class":789,"line":790},[787,1489,1490],{},"int qualifyingCount = 0;\n",[787,1492,1493],{"class":789,"line":796},[787,1494,1323],{},[787,1496,1497],{"class":789,"line":802},[787,1498,805],{},[787,1500,1501],{"class":789,"line":808},[787,1502,1503],{},"    if (score >= 40.0)\n",[787,1505,1506],{"class":789,"line":814},[787,1507,855],{},[787,1509,1510],{"class":789,"line":820},[787,1511,1512],{},"        qualifyingCount++;\n",[787,1514,1515],{"class":789,"line":863},[787,1516,866],{},[787,1518,1519],{"class":789,"line":869},[787,1520,817],{},[787,1522,1523],{"class":789,"line":921},[787,1524,1525],{},"System.out.println(qualifyingCount); \u002F\u002F 4\n",[772,1527,1529],{"id":1528},"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)",[768,1531,1532,1533,1191,1536,1539,1540,1543],{},"Only neighboring elements matter here, so a single loop comparing ",[784,1534,1535],{},"matchScores[i]",[784,1537,1538],{},"matchScores[i + 1]"," is enough — bounded by ",[784,1541,1542],{},"length - 1"," so it never reads one past the end:",[777,1545,1547],{"className":779,"code":1546,"language":781,"meta":782,"style":782},"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",[784,1548,1549,1554,1558,1563,1567,1572,1576,1581,1585,1589,1594],{"__ignoreMap":782},[787,1550,1551],{"class":789,"line":790},[787,1552,1553],{},"public static boolean hasBackToBackTie(double[] scores)\n",[787,1555,1556],{"class":789,"line":796},[787,1557,805],{},[787,1559,1560],{"class":789,"line":802},[787,1561,1562],{},"    for (int i = 0; i \u003C scores.length - 1; i++)\n",[787,1564,1565],{"class":789,"line":808},[787,1566,855],{},[787,1568,1569],{"class":789,"line":814},[787,1570,1571],{},"        if (scores[i] == scores[i + 1])\n",[787,1573,1574],{"class":789,"line":820},[787,1575,908],{},[787,1577,1578],{"class":789,"line":863},[787,1579,1580],{},"            return true;\n",[787,1582,1583],{"class":789,"line":869},[787,1584,918],{},[787,1586,1587],{"class":789,"line":921},[787,1588,866],{},[787,1590,1591],{"class":789,"line":926},[787,1592,1593],{},"    return false;\n",[787,1595,1596],{"class":789,"line":932},[787,1597,817],{},[777,1599,1601],{"className":779,"code":1600,"language":781,"meta":782,"style":782},"System.out.println(hasBackToBackTie(matchScores)); \u002F\u002F true — matches 2 and 3 both scored 45.5\n",[784,1602,1603],{"__ignoreMap":782},[787,1604,1605],{"class":789,"line":790},[787,1606,1600],{},[772,1608,1610],{"id":1609},"step-7-most-recent-first-order-reverse-in-place","Step 7: Most-Recent-First Order (Reverse in Place)",[768,1612,1613],{},"Swap from both ends toward the middle using a temporary variable:",[777,1615,1617],{"className":779,"code":1616,"language":781,"meta":782,"style":782},"int start = 0, 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",[784,1618,1619,1624,1628,1632,1637,1642,1647,1651,1655,1659],{"__ignoreMap":782},[787,1620,1621],{"class":789,"line":790},[787,1622,1623],{},"int start = 0, end = matchScores.length - 1;\n",[787,1625,1626],{"class":789,"line":796},[787,1627,1116],{},[787,1629,1630],{"class":789,"line":802},[787,1631,805],{},[787,1633,1634],{"class":789,"line":808},[787,1635,1636],{},"    double temp = matchScores[start];\n",[787,1638,1639],{"class":789,"line":814},[787,1640,1641],{},"    matchScores[start] = matchScores[end];\n",[787,1643,1644],{"class":789,"line":820},[787,1645,1646],{},"    matchScores[end] = temp;\n",[787,1648,1649],{"class":789,"line":863},[787,1650,1140],{},[787,1652,1653],{"class":789,"line":869},[787,1654,1145],{},[787,1656,1657],{"class":789,"line":921},[787,1658,817],{},[787,1660,1661],{"class":789,"line":926},[787,1662,1663],{},"\u002F\u002F matchScores is now: 40.0, 52.0, 45.5, 45.5, 38.0\n",[772,1665,1667],{"id":1666},"recap","Recap",[1155,1669,1670,1672,1681,1683,1689],{},[1158,1671,1213],{},[1158,1673,1674,1675,1677,1678,1680],{},"Seeding ",[784,1676,1356],{}," with the first element (not ",[784,1679,1166],{},") avoids a wrong starting point if real values could be at or below zero.",[1158,1682,1216],{},[1158,1684,1685,1686,1688],{},"Adjacent-duplicate checks are a single loop, bounded by ",[784,1687,1542],{}," so it never reads one past the end.",[1158,1690,1222],{},[1235,1692,1237],{},{"title":782,"searchDepth":796,"depth":796,"links":1694},[1695,1696,1697,1698,1699,1700,1701,1702,1703],{"id":1264,"depth":796,"text":1265},{"id":1271,"depth":796,"text":1272},{"id":1308,"depth":796,"text":1309},{"id":1349,"depth":796,"text":1350},{"id":1411,"depth":796,"text":1412},{"id":1479,"depth":796,"text":1480},{"id":1528,"depth":796,"text":1529},{"id":1609,"depth":796,"text":1610},{"id":1666,"depth":796,"text":1667},{"outlineRef":1251,"pairsWith":1705,"status":1706},"[`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":583,"description":782},"f6S4t1l2saOrXXT3nbuDrsuGvPst_crlpy8X27dLdws",{"id":1710,"title":744,"body":1711,"description":782,"extension":1249,"meta":2094,"navigation":993,"path":743,"seo":2096,"stem":745,"__hash__":2097},"exercises\u002Fshockwave-curriculum\u002Fexercises\u002Fch09-storing-data\u002F9.5-implementing-array-algorithms.md",{"type":761,"value":1712,"toc":2090},[1713,1716,1720,1726,1767,1772,1804,1810,1834,1852,1856,1881,1884,1928,1933,2037,2088],[764,1714,744],{"id":1715},"implementing-array-algorithms-exercises",[772,1717,1719],{"id":1718},"multiple-choice","Multiple Choice",[768,1721,1722,1725],{},[1161,1723,1724],{},"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?",[777,1727,1729],{"className":779,"code":1728,"language":781,"meta":782,"style":782},"double min = 0;\nfor (double time : climbTimes)\n{\n    if (time \u003C min)\n    {\n        min = time;\n    }\n}\n",[784,1730,1731,1736,1741,1745,1750,1754,1759,1763],{"__ignoreMap":782},[787,1732,1733],{"class":789,"line":790},[787,1734,1735],{},"double min = 0;\n",[787,1737,1738],{"class":789,"line":796},[787,1739,1740],{},"for (double time : climbTimes)\n",[787,1742,1743],{"class":789,"line":802},[787,1744,805],{},[787,1746,1747],{"class":789,"line":808},[787,1748,1749],{},"    if (time \u003C min)\n",[787,1751,1752],{"class":789,"line":814},[787,1753,855],{},[787,1755,1756],{"class":789,"line":820},[787,1757,1758],{},"        min = time;\n",[787,1760,1761],{"class":789,"line":863},[787,1762,866],{},[787,1764,1765],{"class":789,"line":869},[787,1766,817],{},[768,1768,1769],{},[1161,1770,1771],{},"Options:",[1155,1773,1774,1784,1795,1801],{},[1158,1775,1776,1777,1780,1781,1783],{},"A. If every real climb time happens to be positive, ",[784,1778,1779],{},"min"," stays ",[784,1782,1166],{}," — a value that was never actually recorded",[1158,1785,1786,1787,1790,1791,1794],{},"B. ",[784,1788,1789],{},"time \u003C min"," should be ",[784,1792,1793],{},"time > min"," to find a minimum",[1158,1796,1797,1798],{},"C. This throws an ",[784,1799,1800],{},"ArrayIndexOutOfBoundsException",[1158,1802,1803],{},"D. Nothing is wrong — this correctly finds the minimum",[768,1805,1806,1809],{},[1161,1807,1808],{},"Answer:"," A",[768,1811,1812,1815,1816,1818,1819,1821,1822,1824,1825,1827,1828,1818,1830,1833],{},[1161,1813,1814],{},"Why:"," Seeding ",[784,1817,1779],{}," with ",[784,1820,1166],{}," 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 ",[784,1823,1166],{}," truly exists in the data. If every climb time is positive, the loop never finds anything smaller than the fake starting point of ",[784,1826,1166],{},", so it reports a minimum that was never actually recorded. The fix is to seed ",[784,1829,1779],{},[784,1831,1832],{},"climbTimes[0]"," before the loop.",[1155,1835,1836,1843,1846],{},[1158,1837,1838,1839,1842],{},"B is wrong — ",[784,1840,1841],{},"\u003C"," is the correct comparison for tracking a running minimum; flipping it would track a maximum instead.",[1158,1844,1845],{},"C is wrong — nothing here reads outside the array's bounds.",[1158,1847,1848,1849,1851],{},"D is wrong — this is exactly the \"seeding with ",[784,1850,1166],{},"\" pitfall the lesson calls out; it only looks correct by coincidence.",[772,1853,1855],{"id":1854},"micro-parsons","Micro-Parsons",[768,1857,1858,1861,1862,1865,1866,1869,1870,1873,1874,1876,1877,1880],{},[1161,1859,1860],{},"Problem:"," Given a class with a ",[784,1863,1864],{},"main"," method where ",[784,1867,1868],{},"int[] channels"," already holds the radio channel numbers assigned to each subteam, and a ",[784,1871,1872],{},"reportDuplicate()"," helper method that is already defined, reorder these fragments into the nested loop (inside ",[784,1875,1864],{},") that checks every pair of channels (not just neighbors) and calls ",[784,1878,1879],{},"reportDuplicate();"," the instant two channels match.",[768,1882,1883],{},"Reorder the fragments below to complete it:",[1155,1885,1886,1892,1898,1904,1910,1916,1922],{},[1158,1887,1888,1889],{},"a. ",[784,1890,1891],{},"    }",[1158,1893,1894,1895],{},"b. ",[784,1896,1897],{},"for (int i = 0; i \u003C channels.length; i++)",[1158,1899,1900,1901],{},"c. ",[784,1902,1903],{},"        if (channels[i] == channels[j]) reportDuplicate();",[1158,1905,1906,1907],{},"d. ",[784,1908,1909],{},"}",[1158,1911,1912,1913],{},"e. ",[784,1914,1915],{},"    for (int j = i + 1; j \u003C channels.length; j++)",[1158,1917,1918,1919],{},"f. ",[784,1920,1921],{},"{",[1158,1923,1924,1925],{},"g. ",[784,1926,1927],{},"    {",[768,1929,1930,1932],{},[1161,1931,1808],{}," b, f, e, g, c, a, d",[777,1934,1936],{"className":779,"code":1935,"language":781,"meta":782,"style":782},"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]) reportDuplicate();\n            }\n        }\n    }\n}\n",[784,1937,1938,1943,1947,1952,1956,1961,1965,1969,1974,1978,1983,1987,1993,1998,2004,2010,2016,2022,2027,2032],{"__ignoreMap":782},[787,1939,1940],{"class":789,"line":790},[787,1941,1942],{},"public class RadioChannelCheck\n",[787,1944,1945],{"class":789,"line":796},[787,1946,805],{},[787,1948,1949],{"class":789,"line":802},[787,1950,1951],{},"    public static void reportDuplicate()\n",[787,1953,1954],{"class":789,"line":808},[787,1955,855],{},[787,1957,1958],{"class":789,"line":814},[787,1959,1960],{},"        System.out.println(\"Duplicate channel assignment detected!\");\n",[787,1962,1963],{"class":789,"line":820},[787,1964,866],{},[787,1966,1967],{"class":789,"line":863},[787,1968,994],{"emptyLinePlaceholder":993},[787,1970,1971],{"class":789,"line":869},[787,1972,1973],{},"    public static void main(String[] args)\n",[787,1975,1976],{"class":789,"line":921},[787,1977,855],{},[787,1979,1980],{"class":789,"line":926},[787,1981,1982],{},"        int[] channels = {10, 15, 22, 8, 15};\n",[787,1984,1985],{"class":789,"line":932},[787,1986,994],{"emptyLinePlaceholder":993},[787,1988,1990],{"class":789,"line":1989},12,[787,1991,1992],{},"        for (int i = 0; i \u003C channels.length; i++)\n",[787,1994,1996],{"class":789,"line":1995},13,[787,1997,908],{},[787,1999,2001],{"class":789,"line":2000},14,[787,2002,2003],{},"            for (int j = i + 1; j \u003C channels.length; j++)\n",[787,2005,2007],{"class":789,"line":2006},15,[787,2008,2009],{},"            {\n",[787,2011,2013],{"class":789,"line":2012},16,[787,2014,2015],{},"                if (channels[i] == channels[j]) reportDuplicate();\n",[787,2017,2019],{"class":789,"line":2018},17,[787,2020,2021],{},"            }\n",[787,2023,2025],{"class":789,"line":2024},18,[787,2026,918],{},[787,2028,2030],{"class":789,"line":2029},19,[787,2031,866],{},[787,2033,2035],{"class":789,"line":2034},20,[787,2036,817],{},[768,2038,2039,2042,2043,2046,2047,2050,2051,2054,2055,2058,2059,2046,2062,2065,2066,2069,2070,2073,2074,2077,2078,2080,2081,2084,2085,2087],{},[1161,2040,2041],{},"Why this order:"," The outer loop (",[784,2044,2045],{},"b",", ",[784,2048,2049],{},"f",") has to exist before the inner loop can be nested inside it. The inner loop starts its ",[784,2052,2053],{},"j"," index at ",[784,2056,2057],{},"i + 1"," (",[784,2060,2061],{},"e",[784,2063,2064],{},"g",") so each pair is only checked once, rather than checking every element against itself and against pairs already covered. The comparison (",[784,2067,2068],{},"c",") sits inside both loops so every pair gets examined. The braces close in reverse of how they opened — the inner loop's brace (",[784,2071,2072],{},"a",") before the outer loop's brace (",[784,2075,2076],{},"d","). The class, ",[784,2079,1872],{},", the ",[784,2082,2083],{},"channels"," array, and ",[784,2086,1864],{},"'s own braces are the given scaffold; only this nested loop needed reordering.",[1235,2089,1237],{},{"title":782,"searchDepth":796,"depth":796,"links":2091},[2092,2093],{"id":1718,"depth":796,"text":1719},{"id":1854,"depth":796,"text":1855},{"outlineRef":1251,"pairsWith":1705,"status":2095},"new — authored exercises (Multiple Choice + Micro-Parsons)",{"title":744,"description":782},"FPW_YSCh_5jihWlC3kKRi3X_k13vm1RTgHZ2nelNimo",1790274944454]