DSA · Theory

Find Relative Complement of two Sorted Arrays

Theory

251/810

Find Relative Complement of two Sorted Arrays

Find Relative Complement of two Sorted Arrays is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Find Relative Complement of two Sorted Arrays.

From the example next to this theory — Find Relative Complement of two Sorted Arrays: dry-run [4, 1, 3].

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Find Relative Complement of two Sorted Arrays? Then show n log n vs n². Then name the trap.

Exam tip

What is Find Relative Complement of two Sorted Arrays? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

# Find Relative Complement of two Sorted Arrays
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Find Relative Complement of two Sorted Arrays: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefFind Relative Complement of two Sorted Arrays — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

DSA · Theory

Find Relative Complement of two Sorted Arrays

← All stacks

Theory

251/810

Find Relative Complement of two Sorted Arrays

Find Relative Complement of two Sorted Arrays is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Find Relative Complement of two Sorted Arrays.

From the example next to this theory — Find Relative Complement of two Sorted Arrays: dry-run [4, 1, 3].

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Find Relative Complement of two Sorted Arrays? Then show n log n vs n². Then name the trap.

Exam tip

What is Find Relative Complement of two Sorted Arrays? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

# Find Relative Complement of two Sorted Arrays
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Find Relative Complement of two Sorted Arrays: dry-run [4, 1, 3]. Say the list after one step.

Short notes

DefFind Relative Complement of two Sorted Arrays — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

Find Relative Complement of two Sorted Arrays

Example

Short notes

Questions

Find Relative Complement of two Sorted Arrays

Example

Short notes

Questions