Runtime $-60$ course points

Welcome to RURacingl You're familiar with runtimes and Blg O notatlon, right? Well, we're bringing that to the racetrackl We're going to create a raceway that will have racers moving through it at different runtimes. Each racer will move a certaln distance through the raceway based on thel given runtime $($ie$.,$ O$(1),O(n),$ wew, etc.$).$ Do not let racers run into the grass!

Ready? Set? Col

Refer to our Programming Assignments FAQ for Instructions on how to install VScode, how to use the command line and how to submit your assignments.

Programming

Write $1$ coding assignment and submit on Autolab.

We provide a zip file containing RUPacing java.

For each problem UPDATE and SUBMIT the corresponding file.

Observe the following rules:

DO NOT add any import statements

DO NOT add the project statement.

DO NOT change the class name

DO NOT change the headers of ANY of the given functions

DO NOT add any new class fields

DO NOT use System.exit$0$

ONLY print the result as specified by each problem. Observe the examplest output, display only what the problem is asking for.

DO NOT print other messages, follow the examples for each problem.

ONLY print the result as specified by each problem. Observe the examples output and display only what the problem is asking for.

DO NOT print other messages; follow the examples for each problem

RU Racing

Overview

This assignment will make you aware of runtime by tasking you with programming racers that move at different "speeds." Each speed will correspond to the successful completion of one lap on a given raceway.

For example, a racer with an O$(1)$ runtime will complete a full lap in a single step, demonstrating constant time complexity. In contrast, a racer with an O$($n$)$ runtime will take n steps to complete the lap, illustrating linear time complexity. Through this exercise, you will visually observe how different algorithmic efficiencies impact performance and understand the practical implications of various runtimes in algorithm design.

You are given different test tracks stored within track" files as a set of points stored in plain text to construct raceways. These points will be drawn upon a $20$ matrix $($character array$)$ where we will determine if racers are moving at the correct pace and direction.

The construction step of the $2$D array will be delegated to a separate function, createRaceway$(0.$

NOTE $-$ If you require a refresher on $2$D arrays, you can refer to your lecture slides or notes. Princeton also offers an overview based on your book.