Overview

Implemented a sorting algorithm using two stacks and a limited instruction set. Designed cost-based heuristics to minimize operations and handle large datasets efficiently. Focused on algorithmic optimization, parsing robustness, and edge-case handling.

Key Features

  • Two-stack sorting logic
  • Cost-based move optimization
  • Input validation & parsing
  • Operation minimization strategy
  • Performance-focused design
CategoryLow Level (C/C++)
RoleIndividual project
Tech StackC, Algorithms, Data Structures
Source CodeView on GitHub

Demo