Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Aeron Roemer - Rock #1

Open
wants to merge 6 commits into
base: master
Choose a base branch
from
Open

Conversation

AeronRoemer
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Nice work Aeron, you hit the learning goals here. Your code was clear and easy to read as well as efficient. Well done.

Comment on lines +22 to 25
Time Complexity: O1
Space Complexity: O1
*/
getFirst() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +32 to 35
Time Complexity: O1
Space Complexity: O1
*/
addFirst(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +42 to 45
Time Complexity: On
Space Complexity: O1
*/
search(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +59 to 62
Time Complexity: On
Space Complexity: O1
*/
length() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +79 to 82
Time Complexity: On
Space Complexity: O1
*/
getAtIndex(index) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +114 to 117
Time Complexity: on
Space Complexity: O1
*/
addLast(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +133 to 136
Time Complexity: On
Space Complexity: O1
*/
findMax() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +153 to 156
Time Complexity: On
Space Complexity: O1
*/
delete(value) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +175 to 178
Time Complexity: On
Space Complexity: O1
*/
visit() {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +213 to 221
while (current) {
// hold the next node temporarily
nextTemp = current.next;
// change current to point at the previous node
current.next = previous;
// increment previous and current each by one
previous = current;
current = nextTemp;
}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I'm not sure what purpose this code serves.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants