Mastering Algorithms with C 《算法精解：C语言描述》源码及Xcode工程、Linux工程

OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.

OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP. Integrated with Sniper simulator.

Data Structure codes implemented in C

This C project is built to schedule exams. It takes a text input file which contains name and lessons for every single person. The program analyses the input file and determine an appropriate exam scheduling so for every person no exam will be overlapping. A common problem in universities since no person can enter two exams at the same time.

Pile of utilities around ugeneric_t type.

Data and File structues

A Minesweeper Game Console Based -- Used C Implemented Some Features . (Including Save/Load and Scoreboard )

dsa-in-c is my personal project showcasing fundamental Data Structures and Algorithms (DSA) in C. As a student, I’ve created this to share clear, beginner-friendly implementations and documentation to aid in understanding these key concepts.

Reversi game using a minimax search with alpha beta pruning

svg2pdf

Artificial Intelligence Lab Course (CS 312), IIT Dharwad

Parallel programming on an SMP and a multicomputer, using OpenMP and MPI, respectively for Parallel and Distributed Computing course. For this purpose, it was developed a serial and two parallel implementations of a sudoku solver.

Assalamualaikum, Groovecho is my third-semester data structure project. Groovecho is a music player where users can create playlists of their favorite songs. The application allows users to add, search, play and delete songs from their playlist. In this project, I utilized linked lists, depth-first search (DFS), and the insertion sort algorithm.

A fast and efficient maze solver.

System programming & Algorithm ― Data structures and Algorithms

A write-up of my solutions to the HackMIT Admission Puzzles 2023

A high-performance C library providing clean, reference implementations of fundamental algorithms. Covers sorting (quicksort, mergesort), searching (binary, linear), graph algorithms (BFS, DFS, Dijkstra), and dynamic programming. Ideal for computer science education, algorithm labs, and as a lightweight, embeddable code reference.

Implementation of different Data Structures

Dijkstra's algorithm, minimum spanning trees, DFS