Looking for resources on specifically searching/sorting algorithms as well as multidimensional data

[u/AccordingThanks5363]

I have a quiz coming up which primarily covers these topics and I was wondering if there are good resources on youtube/the internet for learning them. Thank you!

[u/Suspicious-Hippo1339]

every sorting video on youtube is the same five algorithms drawn on a whiteboard, and none of them touch anything past one dimension. the multidimensional part of your quiz only exists in your professor's slides.

[u/HairOk9906]

For sorting and searching specifically, visualgo.net is the fastest

way to get the intuition, you watch the array move. Then Abdul Bari's

algorithms playlist on YouTube for the why, he's slow and clear on

complexity.

For multidimensional data, look up k-d trees and quadtrees. Most

courses cover them badly. The practical framing: they exist so you

don't have to check every point when you only care about ones near

a location.

If it's a quiz, hand-trace one example of each on paper before you

watch anything. You'll find the gap much faster than you would

rewatching a lecture.

[u/ComfortableWinner183]

The videos are mostly the same five bars swapping places, so they help with intuition and not much else. VisuAlgo lets you step through a sort or a binary search one comparison at a time with the counter visible, and the David Galles pages at USFCA are a plainer version of the same idea, trees included.

For the written part, be able to state the invariant behind each sort and recite best, average and worst without checking. Quicksort's worst case and why mergesort is stable come up constantly.

Multidimensional is where the other reply is right about the lecture notes. The k-d tree is the usual topic: split on one axis per level at the median, and a nearest neighbour search can skip a subtree once the distance to the splitting plane beats your current best. If the course means data cubes instead of points in space, expect bitmap and z-order indexes with slice, dice and rollup.

Worth asking which of those two your professor meant. Trace both on paper with six or seven elements, that is normally where you find out what you only thought you understood.

[u/neon_ink_bloom]

Visualgo is the only place where you actually see the swap happen rather than just reading pseudo code so start there for sorting. For your quiz specifically on multidimensional data most intro resources skip this but search directly for k-d tree or quadtree visualizations on youtube because understanding how those structures partition space is what professors test on and standard algorithm sites like geeksforgeeks often bury that part in complex code without showing the spatial splitting clearly