implementation of algorithm design

Rust + WebAssembly demo of the closest pair problem

The project implements an algorithm that finds the closest pair of points in a 2D screen using a time complexity of O(n log n). The algorithm is implemented in an iOS application using the MVC architectural pattern.

Codes and experiments for paper "Distributed Learning with Random Features". Preprint.

My DSA journey....🚶‍♂️

Data Structure & Algorithm 4th Sem

Efficient Python implementation of Merge Sort, a stable, divide-and-conquer sorting algorithm with O(n log n) time complexity. This repository includes well-documented code for splitting arrays, recursively sorting subarrays, and merging them back. Ideal for understanding core sorting techniques and comparing with other algorithms.

This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.

Solutions of Algorithms.

Divide & Conqure Algorithm

Codes and experiments for the paper "Max-Discrepancy Distributed Learning: Fast Risk Bounds and Algorithms"

Exploring different methods & algorithms, practicing fundamental techniques and terms of algorithm design domain

Solving various problems with the help of Algorithms DP and D&Q related to the Algorithm Design Course of University of Isfahan

A comprehensive collection of algorithmic problem solutions implemented in C#. Ideal for those looking to enhance their problem-solving skills and deepen their understanding of algorithmic concepts.

Some common problems in dsa with C/C++ And Java

Long arithmetic calculator

solved geek for geeks and UVA problems

Bank console application implemented using c++ and object-oriented programming paradigm connected and deals with files as a database.