Welcome to AP Computer Science A. If you are a student in the class, the first thing you need to do (and which we should have done in class) is set up your GitHub account.
Once you have a GitHub account, click “Log in to GitHub” below to proceed.
If you don’t have a GitHub account yet, please create one and then log in here for further instructions.
Congratulations! You have successfully connected this app to GitHub. However you are not yet a member of the GitHub organization for this class, something Mr. Seibel needs to set up for you.
This is your GitHub profile URL:
Click the clipboard icon to copy it and then submit it at this form so he can add you.
Congratulations! You have successfully connected this app to GitHub. And it looks like you have an invitation to join the GitHub organization for this class. You need to accept that invitation before you can proceed. The invite should be sent to whatever email you used when you created your GitHub account.
I see you are logged into GitHub and a member of the berkeley-high-cs GitHub organization. However there seems to have been some problem finishing the setup for your account. Please let Mr. Seibel know.
This is a tool for the AP Computer Science A class at Berkeley High School. It is intended to provide a simple environment for experimenting with Javascript without all the complexities of a full development environment such as ReplIt or Glitch which we may use later in the year.
It is also designed to take advantage of the browser’s ability to run Javascript natively. It does not need access to a server to run code making in extremely responsive even if the Wifi is flaking out.
Finally, under the covers it is saving work to a GitHub repository in a very simplified workflow that does not depend on immediately learning any git commands. Code written in this environment for each assignment is saved to a directory and branch specific to that assignment each time it is saved. Thus when the assignment is done, it is easy to go to GitHub and create a PR containing just the work on that assignment which can then be commented on and worked on further before it is turned in and merged to main.
You're all set! You don't need to worry about this yet but we have successfully created a GitHub repository for your work:
You can get to it any time by clicking on your GitHub username at the top-right of the screen.
A small pop quiz. Just asking you to do some code reading.
Here is the code for a selection sort. (The
swap method does what you’d expect: it swaps the
elements in the array at the two indices.)
public static void selection(int[] nums) {
for (int i = 0; i < nums.length - 1; i++) {
int idxOfNext = i;
for (int j = i + 1; j < nums.length; j++) {
if (nums[j] < nums[idxOfNext]) {
idxOfNext = j;
}
}
swap(nums, i, idxOfNext);
}
}
After the first iteration of the outer loop, what element is in
nums[0]?
The largest number in the array
The smallest number in the array
The original value of nums[0]
Here is the code for an insertion sort. (The
swap method is the same as in the first question.)
public static void insertion(int[] nums) {
for (int i = 0; i < nums.length; i++) {
int j = i;
while (j > 0 && nums[j - 1] > nums[j]) {
swap(nums, j, j - 1);
j--;
}
}
}
After the first iteration of the outer loop, what element is in
nums[0]?
The largest number in the array
The smallest number in the array
The original value of nums[0]