79690664

Date: 2025-07-04 21:33:04
Score: 2
Natty:
Report link

This visualization, made with invocation_tree, shows how mergesort([3,2,7,1,4,6,5]) repeatedly splits the problem into sub-problems until a sub-problem is sorted, and then recombines the result of two sorted sub-problems using merge() before it returns:

call tree

This is the final result as a static image for your viewing pleasure:

final image

Reasons:
  • Probably link only (1):
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Gijs van Gelderen