01Computer Science Tools
Free interactive CS tools — visualise sorting algorithms, convert between number bases, simulate logic circuits and explore fundamental concepts.
Watch sorting algorithms run step by step — bubble, selection, insertion, merge, quick, and heap sort — with adjustable size and speed and Big-O complexity info.
Convert between binary, decimal, hexadecimal and octal with steps.
Add, subtract and multiply binary numbers with working shown.
Apply AND, OR, XOR, NOT, NAND, NOR and bit shifts with aligned bit-column visualization.
Compare time and space complexities of common algorithms interactively.
Visualise the recursion tree for any recurrence relation.
Generate truth tables for any boolean expression.
Build and simulate circuits using AND, OR, NOT and XOR gates.
Convert characters to ASCII codes, hex and binary representations.
Convert signed integers to two's complement step by step.
Build a Huffman tree and encode any string.
Animate push, pop and peek operations on stacks and queues.
Animate breadth-first and depth-first traversal on a custom graph.
Find the network address, broadcast address and usable IP range.
Convert decimal numbers to IEEE 754 binary32 or binary64 format.
Convert text to binary, hex, or decimal bytes and back — full Unicode support, live in both directions.
About these computer science tools
These CS tools are built around visualisation and interactivity — because seeing an algorithm run is worth a thousand lines of explanation. Watch Bubble Sort, Merge Sort, Quick Sort, and Heap Sort race side by side. Animate BFS and DFS traversal on a custom graph you draw yourself. Build logic circuits from AND, OR, NOT, and XOR gates and probe every wire.
Every tool runs entirely in your browser with no signup required. Whether you're a student learning data structures and algorithms, a developer brushing up on binary arithmetic or network subnetting, or an interview candidate revisiting Big O complexity — these tools are ready immediately.