Using Divide and Conquer to solve Closest Pair Problem

Overview and detailed dicussion about parallel volume rendering on a cluster. We describe algorithms, optimalization techniques and challenges for real time rendering of big data on high performance clusters.

🐟 Epsilon nets

A project for Algorithms Analysis and Design (CSG3F3) in 2014, by : Beryl Ramadhian Aribowo, Mohamad Fachrur Ridwan, Satrio Kamaludin, Muhammad Iqbal

The repository contains the code for various algorithms and coding techniques.

Algorithm Design & Analysis Lab Work

Strassen's Algorithm for Faster Matrix Multiplication

Algorithms and problems solved.

Finds how similar 2 lists of rating are using the Divide and Conquer approach. Extension of MergeSort that actually displays the specific inversions as well as just counting the total number.

Lab program for ADA Lab

Design and Analysis of Algorithms (CS3230) - National University of Singapore

Multiplying square matrices recursively, via the divide and conquer approach and Ruby

This repository contains solutions to some of the LeetCode Problems.

C++ implementations of algorithms dealing with the divide and conquer strategy, dynamic programming, greedy programming, graph theory, and other interesting staples.

Various algorithms and data structures for educational purposes

An implementation of Delaunay triangulation using divide and conquer algorithm

Assignments of the Coursera MOOC offered by University of California, San Diego