The Open Source Swiss Army Knife

/code/c/algorithms_c/
/code/c/algorithms_c/ + sub-categories
http://www.sirfsup.com/
web directory content
    
      

Not logged in
Chat Register Login
return to:  http:/www.sirfsup.com      /code   /c   /algorithms_c 
sub-categories and articles

                                                  
diralgorithms_swb switchboard to programmingToolBox/algorithms
dirbinary_search add
dircoloring add
dirdataStructures binary trees, heaps, hashes etc.
dirdataStructures_c add
dirgeneric_bin_tree add
dirhashtable hashtable with a complicated hashing function, and a double array of hash elements
dirpermutations add
dirsorts bubble sort, quicksort, insertion sort
   --->create new sub-category


binary_exp.c
c binary exponentiation algorithm

int binary_exponent(int, int );

binary_exponen.txt
add

binary exponentiation ===================== it is about how to compute a positive number raised to some power 13 = 1*2^3 + 1*2^2 + 0*2^1 + 1*2^0

binomial.c
binomail coefficient algorithm in C with and without memoization

// assignment:

binrec.c
add

int binrec(int n) {

exponentiate.cpp
need compile with g-plus-plus

#include <stdio.h>

factorial.c
c factorial algorithm

#include <math.h> 

fibonacci.c
fibonacci numbers pow

#include <math.h> 

greedyKnapsack.c
add

// source: computer algorithms c++

mystery.c
add

// assignment: use memoization result to print out results for 

selection.c
chooses smallest item from array using Partition

// moved to the sorts/ directory along with the other sorts done in c
   --->upload your article


User submitted category site links


(None)

-->submit a page from your site dealing with algorithms_c to the sirfsup! web directory for listing

return to top