Sort the array of strings according to alphabetical order defined by another string
Sort the array of strings according to alphabetical order defined by another string 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 Sort the array of strings according to alphabetical order defined by another string.
From the example next to this theory: Sort the array of strings according to alphabetical order defined by another string — arrays give O(1) index access; matrices are arrays of arrays.
Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.
Viva: what is Sort the array of strings according to alphabetical order defined by another string? Then show n log n vs n². Then name the trap.
index → 0 1 2 array → [10, 20, 30]
What is Sort the array of strings according to alphabetical order defined by another string? Show this: n log n vs n². Trap: unstable sort when equal keys matter.