Go Data Structures and Algorithms is an open source tool for learning and rehearsing data structures and algorithms in Go.
Estrutura de dados e Algoritmos em Golang
Coursera Stanford Algorithm Course: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Golang ALGOrithmS implementation with optimization techniques in some cases.
Trabalho para a disciplina de Projeto e Análise de Algoritmos que visa resolver o Problema da Maior Subsequência Crescente Contígua com algoritmo de Divisão e Conquista
Convex Hull algorithm (Divide and conquer) implementation in Go.
A collection of algorithms and data structures implemented in Go
Golang programs for finding closest pair of points using Divide and Conquer Algorithm
Add a description, image, and links to the divide-and-conquer topic page so that developers can more easily learn about it.
To associate your repository with the divide-and-conquer topic, visit your repo's landing page and select "manage topics."