In-Class

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

In-Class

In-Class Activity to be completed in class.

Note: For this activity and all other activities, you should only make 1 submission (your first submission is always the one graded)

Sign in to Google to save your progress. Learn more

* Indicates required question

First Name *

Your answer

Last Name *

Your answer

E-mail (Please use Northeastern e-mail) *

Your answer

Which section of Algorithms are you in? *

Mike

John

What is the complexity of quicksort? *

1 point

N*log(N) average case

What is the complexity of heapsort? *

1 point

O(N*N)

O(log(N)* log(N))

O(N*log*N)

What is the complexity of merge sort? *

1 point

O(N*N)

O(N*log(N))

Submit

Clear form

Never submit passwords through Google Forms.

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy