C++ Programming Tutorial

 
 
 

Data File Structure Programs

Array

Insert, edit, delete, append, display, Srch. Insert, delete, merge, delete multiple occurrences Arrays as a Stack in graphics

Stack

Stack operations using array Stack using static memory allocation Stack using dynamic memory allocation Double ended link list as a stack Lnked list as a Stack Infix expr. to Postfix expr. Postfix expr. into an Infix expr. Arrays as a Stack in graphics Stack as an Arithmetic expr. Evaluater Graphical Rep. of Stack Stack to traverse - inodr, postodr, preodr

Queue

Queue using static memory allocation Queue using dynamic memory allocation Circular queue Linked list as a Queue Double Ended linked list as a Queue Graphical Rep. of Queue Arrays as a Linear Queue Array as a Circular Queue Arrays as a Linear Queue ( in graphics ) Arrays as a Circular Queue ( in graphics )

Linked List

Singly link list Circular linked list Doubly link list Linked list as a Queue Linked list as a Stack Double Ended linked list as a Queue Double Ended linked list as a Stack Infix to Postfix - Linked List as Stack Circular doubly link list Single Ended Linked List - Sorting in both odr Hashing - double ended Linked List Sort of link list

Tree

Linked List as a Binary Srch. Tree Set Class using Binary Srch. Tree Maximum depth of Binary Srch. Tree Minimum Spaning Tree Prims algo - minimum spanning tree Traverse binary tree - inodr, preodr, post Find number in binary Srch. tree display levell

Sorting

Bubble Sort Selection Sort Insertion Sort Radix Sort Merge Sort Quick Sort Heap Sort Linear Sort Shell Sort Topological Sort

Searching

Linear Srch. or Sequential Srch. Binary Search Breadth First Search Traversal Depth First Search Traversal Shortest Path-Given Source-Destination-Dijkstras

Hashing

Simple implementation of Hashing Hashing using double-ended Linked List Hashing using Mid-Square Method Example of Hashing n term of the fibonacci series using recursion

Recursion

Factorial of the given number using recursion Mystery of Towers of Hanoi using recursion
 

Program that reads a numbers , computes and displays the factorial of the given number using recursion

 

Image

 #include<iostream.h>
 #include<conio.h>

 long fact(int);

 main()
    {
       clrscr();

       int number;
       long factorial;

       cout<<\"\\n Enter the number = \";
       cin>>number;

       factorial=fact(number);

       cout<<\"\\n n! = \"<<number<<\"!\"<<\"  =  \"<<factorial<<endl;

       getch();
       return 0;
    }



 //----------------------------  fact(int)  ------------------------------//


 long fact(int number)
    {
       long factorial=1;

       if(number==0 || number==1);

       else
      factorial=number*fact(number-1);

       return factorial;
    }

    Related Post:
  1. Program to show the 3D Reflection Transformation along xy-plane
  2. Program that maintains library shop stock using link list
  3. Program to perform heap sort
  4. Program to create and display link list
  5. Program to show the use of Bitwise Operator AND (&)
  6. C++ Hotel Management Project
  7. Program that defines template of vector class that provides modify and multiplication facility
  8. Program to help Umar in this task. Represent each city by one lowercase character. Thus, you can have at most 26 different cities to visit....
  9. Program to illusrate data conversion user defined data types using constructor
  10. Program to fill different types of geometric shapes using Boundary Fill Algorithm
  11. Program to implement Lexical Analyzer
  12. Program to illustrate an example of Polymorphism
  13. Program of cohen sutherland Line clipping Algorithm
  14. Program of disk editor
  15. Program simulate the working of Pre-Processor
  16. Program to multiply 2 polynomial functions
  17. Program to illustrate the role of destructor in classes
  18. Text Animation in Graphics Screen
  19. Program to illustrate an example of containership
  20. Program to translate integer numbers given in words into numeric representation