Mathematics projects and source code

Polygon addition in c

The following C project contains the C source code and C examples used for polygon addition. This program is meant to store the polynomial of a single variable in a matrix form and perform addition & subtraction operation on two such polynomial.

Operations on sets in c

The following C project contains the C source code and C examples used for operations on sets. This program can be used to perform elementary operations on sets. The sets can be of any type, using templates. An example using integers has been illustrated.

Max heap in c

The following C project contains the C source code and C examples used for max heap. Max heap is a binary tree like data structure, that always contains the biggest element at its top. Max heap is greatly used in searching and sorting algos and in priority queues, as it reduces the sorting time to o(nlogn).

Matrix algebra in c

The following C project contains the C source code and C examples used for matrix algebra. natural look of matrix.you can add, subtract, multiple two matrics on one screen.also u can find transpose,negative,scaler multiplication and scaler divison of a matrix.

Heap sort in c

The following C project contains the C source code and C examples used for heap sort. This is a heap sort algorithm that implements an array as a heap, sorts as many as 10000 numbers that are randomly generated and writes them to a file called "heap.out".

Graph (dfs,bfs) in c

The following C project contains the C source code and C examples used for graph (dfs,bfs). Representation of Graph using Linked List and Traversal of Graph using DFS and BFS :) Happy Hacking Editor : VIM Compiled using: GCC 4.5.1

Circle in c

The following C project contains the C source code and C examples used for circle. This file contains a Circle data structure. Provides functionality for finding area, diameter, radius, and circumference.

Binary heap in c

The following C project contains the C source code and C examples used for binary heap. Class Heap is a utility for storing up to N items of type T. This class allows adding an item or extracting the best item. Supported operations are accomplished at O(log(n)), where n is the current number of items in the heap.

Best linked list functions in c

The following C project contains the C source code and C examples used for best linked list functions. all the functions of a linked list, ADD, Display, Delting a Node have been included, with all comments and easiest way to understand the Monsterous Linked List functions, from today you will love Data Structures :-)

A templated binary tree class in c

The following C project contains the C source code and C examples used for a templated binary tree class. This is my example of a templated binary tree class and its usage. Comes with sample program. Operations include inserting and deleting nodes, listing nodes in preoder, postorder and inorder and deleting the tree or a subtree. Feedback is welcome.

A recursive solution to the hanoi towers puzzle in c

The following C project contains the C source code and C examples used for a recursive solution to the hanoi towers puzzle. This program implements a C++ solution to the well known "Hanoi Towers Puzzle",this algorithm simply use recursion to solve the puzzle for any given number of disks in the original position (usualy,all the disk are staked on the first peg and there are 3 pegs).

Pages

Subscribe to RSS - Mathematics