Skip to editor
File
New File Ctrl+N
New Folder

Save Ctrl+S
Upload File…
Download as ZIP

Delete File

Reset Files…
View
Toggle Sidebar Ctrl+B
Toggle Terminal Ctrl+`

Word Wrap Alt+Z

Exercise Info
Run
Run Code Ctrl+Enter
Save & Run F5

Clear Output
CS174: OOP - Drills - Array 3 Sort
Explorer
GitHub

Connect to GitHub to push and pull your project files to a repository.

On the page that opens, create a token with repo scope, copy it, then paste it below.

Paste the personal access token you created on GitHub with repo scope.

Click Refresh to load commit history
Exercise Info
← Prev Next →

Goals

  1. To do proper array indexing
  2. To allocate and populate new arrays
  3. To use conditional statements appropriately
  4. To properly define methods

Instructions

Create a static method sort3Elements that takes in 3 integers and returns a 3-element array containing those integers in sorted order. For instance, if it receives the integers 7, 1, and 3, it should return the array {1, 3, 7}

The Ursinus-WebIDE by Chris Tralie (opens in new tab) and Bill Mongan (opens in new tab)

Your browser does not support WebGL. A graphical rendering canvas would appear here.


          
No suggestions. Code quality feedback will appear here.
Not logged in java
Ln 1, Col 1