Sorting Algorithms

0.0(0)
studied byStudied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/5

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 1:59 PM on 1/28/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

6 Terms

1
New cards

What does it mean when an Algorithm is Stable?

when all the elements are arranged in the same relative order as they appear in the input

2
New cards

What does it mean when an Algorithm is In Place?

only a constant number of elements of the input array are ever stored outside of the array at any given time

3
New cards

How do Divide and Conquer Algorithms work?

  1. breaking down the problem into smaller independent sub-problems,

  2. solving the sub-problems recursively, and

  3. combining the solutions of the sub-problems to construct the solution to the original problem

4
New cards

What is the Master Theorem?

f(n) is the cost of combining solutions of the smaller sub-problems in the recursive calls

<p>f(n) is the cost of combining solutions of the smaller sub-problems in the recursive calls</p>
5
New cards

What are the differences between Merge Sort and Quicksort?

<p></p>
6
New cards

What do we mean by "Solving the Recurrence Relation"?

knowt flashcard image