A set of efficient data structures in C, created in a generic way
-
Updated
Oct 3, 2023 - C
GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
void-pointersHere are 12 public repositories matching this topic...Sort: Most stars
Sort options
A set of efficient data structures in C, created in a generic way
c stack queue graph bloom-filter priority-queue hash-functions data-structures red-black-tree heap abstract-data-types hash-table prim-algorithm separate-chaining weighted-graphs abstract-data-structures utility-functions double-hashing void-pointers
All algorithms and datastructures from Introduction to Algorithms (CLRS) in C
huffman karatsuba network-flow generic edit-distance fast-fourier-transform red-black-tree dijkstra hashtable clrs kruskal prim fibonacci-heap union-find strassen fulkerson push-relabel kuhn-munkres bipartite-matching void-pointers
Binary Search Trees, Splay Trees and Red Black Trees implemented in C
Writing my own library with standard functions in C.
Create dynamically-allocated arrays of any data type in the C language.
Void data pointers manager for dedications by value, managing: insertion, deletion, finding, and printing operations.
Implementação de Vetor Ordenado Genérico (ADT) em C. Utiliza ponteiros void e callbacks de comparação para manter a ordenação na inserção (Insertion Sort logic) com suporte a polimorfismo.
c vector data-structures generic-programming memory-management sorted-array abstract-data-type void-pointers linear-data-structure
Simulador de bocha geométrica em C99 utilizando Filas e Pilhas | ED1 - UEL
svg stack queue geometry c99 data-structures computational-mathematics file-handling abstract-data-types geometric-shapes polimorphism file-parsing uel void-pointers generic-data-structures overlapping-geometric-shapes
A library that I am working on, a generic abstract data structure library for C/C++ utilising void pointers.
c cpp graphs data-structures binary-trees pointers stacks queues linked-lists dynamic-arrays linked-list-in-c void-pointers pointers-in-c
Implementação genérica de Heap Binária (Fila de Prioridade) em C. Utiliza manipulação de ponteiros void e callbacks de comparação para suportar ordenação polimórfica de qualquer tipo de dado.
c priority-queue data-structures generic-programming memory-management polymorphism binary-heap heapsort algorithm-analysis void-pointers
Implementação de um Sistema de Informações Geográficos (SIG), utilizando C99 e Hash Extensível em arquivo para gerenciar dados urbanos de habitantes| ED2 - UEL
svg unit-testing c99 gcc gis data-structures hashmap file-handling abstract-data-types extendible-hashing unity-framework file-parsing uel void-pointers generic-data-structures
Simulador de Invasão Alienígena em C99 com cálculo de Polígonos de Visibilidade, Árvore AVL, Lista Duplamente Encadeada e Ordenação (Merge/QuickSort) | ED1 - UEL
svg avl-tree geometry makefile c99 data-structures file-handling sorting-algorithms geometric-shapes geometric-algorithms doubly-linked-list polimorphism file-parsing uel void-pointers poligon visibility-problem generic-data-structures
Add this topic to your repoTo associate your repository with the void-pointers topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |