asm-disassembler

This C# ASM Disassembler translates bytecode into human-readable assembly language swiftly and accurately. It's a vital tool for reverse engineering and understanding low-level code, ensuring efficient analysis and modification of binary programs.

assembler

This C# Assembler is a powerful tool designed to effortlessly convert byte code into assembly language (ASM).

astarvisualizer

The A* Visualizer showcases the A* path finding algorithm in finding the shortest path between two points. This interactive tool allows users to witness the algorithm in action, visually demonstrating its optimal route-finding capabilities

b-tree

This B-Tree implementation offers efficient insertion, deletion, and search operations on large datasets. Perfect for handling sorted data, it provides fast and balanced tree-based storage, making it an essential for dealing with vast amounts of structured information.

bellmanford

Implementation of Bellman-Ford cycle detection in a weighted graph

binaryheap

This binary heap implementation is a complete binary tree with efficient insertion and extraction of the minimum element. It's ideal for priority queue implementations, ensuring fast access to the smallest element in constant time.

binarysearchtree

Full BST

bloomfilter

This Bloom Filter implementation offers probabilistic data structure for fast set membership testing. Efficiently handling large datasets with minimal space, it ensures quick and accurate element existence checks, limits memory usage and retains speed.

brickbreaker

computervisioncalculator

customjvm

This custom Java Virtual Machine (JVM) in C# is a high-performance implementation, enabling execution of Java bytecode on the C# platform. It has a flexible environment for running Java applications, this JVM bridges the gap between Java and C# ecosystems, providing a tool for cross-language development and compatibility testing.

datastructures_simplesorts

Bubble Sort, Insertion Sort, Selection Sort, Sort Visualizer

hashmap

This hash map implementation provides fast and constant-time average lookup, insertion, and deletion operations. Ideal for managing key-value pairs, it offers efficient data retrieval and storage, ensuring seamless handling of dynamic datasets in various applications.

huffmancoding

This Huffman Coding implementation provides compression and decompression capabilities for various data types. Its encoding algorithm enables space-saving storage and swift data transmission, sees use in effective data compression solutions.

hundredsmonogame

yes

linkedlistdatastructures

lrucache

Custom cache object that clears the least-recently-used items.

nystagmusense

Mobile Phone-based Contrast Sensitivity Function exam that measures the user's ability to resolve fine details based on the contrast.

obstaclecourse

rohan-dev-c

Config files for my GitHub profile.

skiplist

This implementation of skip list offers efficient search, insertion, and deletion operations in sorted collections. Its balanced design enables logarithmic time complexity.

snake

Snake Game Using Monogame

stacks

union-find