conquer-algorithm

Here are 2 public repositories matching this topic...

Samson-Mano / Delaunay-triangulation

This is a C# implementation of Divide and conquer Delaunay triangulation. The implementation follows Guibas and Stolfi’s paper. This is the vertical cut implementation of divide and conquer.

mesh mesh-generation divide delaunay-triangulation divide-and-conquer conquer-algorithm delaunay-triangulator divide-and-conquer-division guibas vertical-cuts lr-edge

Updated Jan 30, 2024
C#

DaniloNovakovic / sorting-algorithms-in-c

Star

Implementation of O(n), O(nlgn), and O(n^2) sorting algorithms in C programming language 🚴‍♂️

c console deprecated archived bubble-sort insertion-sort sorting-algorithms selection-sort obsolete school-education sorted-lists bucket-sort radix-sort merge-sort quick-sort heap-sort conquer-algorithm

Updated Jul 13, 2019
C

Improve this page

Add a description, image, and links to the conquer-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the conquer-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly