CS 1332 Certification Questions and CORRECT Answers
6 views 0 purchase
Course
CS 1332
Institution
CS 1332
Adaptivefaster when data is already sorted
Stableequal valued elements are in the same relative order before and after sorting
In-Placedoes not need an additional data structure besides the array already storing the
data. O(1) extra memory
Iterative Sortssort one at a time
Divide and Conquer ...
CS 1332 Certification Questions and CORRECT Answers Adaptive✔✔✔ faster when data is already sorted Stable✔✔✔ equal valued elements are in the same relative order before and after sorting In-Place✔✔✔ does not need an additional data structure besides the array already storing the data. O(1) extra memory Iterative Sorts ✔✔✔ sort one at a time Divide and Conquer Sorts ✔✔✔ break the original l arge problem into sub -problems, solve, and then combine solutions to solve large problem (mostly recursive) Non-Comparison Based Sorts ✔✔✔ at no point can we compare two objects Bubble Sort Qualities: ✔✔✔ Adaptive, Stable, In -Place Insertion Sort Qualities: ✔✔✔ Adaptive, Stable, In -Place Selection Sort Qualities: ✔✔✔ In-Place CocktailShaker Sort Qualities: ✔✔✔ Adaptive, Stable, In -Place Heap Sort Qualities: ✔✔✔ None Merge Sort Qualities: ✔✔✔ Stable Quick Sort Qualities: ✔✔✔ In-Place Quick Select Sort Qualities: ✔✔✔ In-Place LSD Radix Sort Qualities: ✔✔✔ Stable Bubble Sort Runtime: ✔✔✔ Best: O(n) Avg: O(n^ 2) Worst: O(n^ 2) Insertion Sort Runtime: ✔✔✔ Best: O(n) Avg: O(n^ 2) Worst: O(n^ 2) Selection Sort Runtime: ✔✔✔ Best: O(n^ 2) Avg: O(n^ 2) Worst: O( n^2) CocktailShaker Sort Runtime: ✔✔✔ Best: O(n) Avg: O(n^ 2) Worst: O(n^ 2) Heap Sort Runtime: ✔✔✔ Best: O(nlogn) Avg: O(nlogn) Worst: O(nlogn) Merge Sort Runtime: ✔✔✔ Best: O(nlogn) Avg: O(nlogn) Worst: O(nlogn) Quick Sort Runtime: ✔✔✔ Best: O(nlogn) Avg: O(nlogn) Worst: O(n^ 2) Quick Select Sort Runtime: ✔✔✔ Best: O(n) Avg: O(n) Worst: O(n^ 2) LSD Radix Sort Runtime: ✔✔✔ Best: O(kn) Avg: O(kn) Worst: O(kn) Brute Force Runtime: ✔✔✔ Best: O(n) Avg: O(nm) Worst: O(nm) Boyer-Moore with Galil Rule Runtime: ✔✔✔ Best: O(n+m) Avg: O(n+m) Worst: O(n+m) Boyer -Moore without Galil Rule Runtime: ✔✔✔ Best: O(m) Avg: O(nm) Worst: O(nm)
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller WIZGrades. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $9.99. You're not tied to anything after your purchase.
