iSorting

iSorting is a hands-on sorting visualizer designed for learning and teaching. Visualize Mode * Choose from 11 algorithms (Bubble, Selection, Insertion, Merge, Quick, Heap, TimSort*, IntroSort*, Counting, Radix, Bucket) * Watch each step with clear highlights: * comparing, swapping, writing/overwriting, pivot, locked tail, pointer index * Learn with teaching-friendly pacing: * focus (what is being compared / acted on) * action (swap/write animation) * Manual Step or Auto-run with adjustable interval * Reset (new numbers) or Restart (same numbers) * Adjust item count (2–10) and MaxValue (for Counting/Radix/Bucket) Guide Mode * For every algorithm: * idea, time complexity (best/avg/worst), space, stability * pros & cons, best for, notes * Quick comparison list for all algorithms *TimSort and IntroSort are educational simplified versions to make the logic easier to follow. Note: Counting/Radix/Bucket assume non-negative integers.