ACMSolver :: Art of Programming Contest, Tips and Tricks for C, C++, Java

//Bubble Sort

#include <iostream.h>
#include <conio.h>
#define MAX 10

class bubsort{
    int arr[MAX],n;
    public:
    void getdata();
    void showdata();
    void sortLogic();
};

void bubsort :: getdata(){
    cout<<"How many elements you require : ";
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>arr[i];
}

void bubsort :: showdata(){
    cout<<"\n--Display--\n";
    for(int i=0;i<n;i++)
        cout<<arr[i]<<"   ";
}

void bubsort :: sortLogic(){
    int temp;
    for(int i=0;i<n;i++){
        for(int j=0,exchange=0;j<n;j++){
            if(arr[j] > arr[j+1]){
                temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
                exchange++;
                cout<<"\n arr[j] = "<<arr[j]<<"  arr[j+1] = "<<arr[j+1];
            }
        }
        cout<<endl;
        if(exchange==0)
            break;
    }
}

void main(){
    clrscr();
    cout<<"\n*****Bubble Sort*****\n";
    bubsort obj;
    obj.getdata();
    obj.sortLogic();
    obj.showdata();
    getch();
}

ReHash – A console-based hash calculator -

Using PPMD for compression -

Genetic and Ant Colony Optimization Algorithms -

A Mersenne Twister Class -

CFraction – a double / fraction / string conversion class -

File Exist Algorithms -

Resize the array -

Create and pass a 2D dynamic array -

PAGE REPLACEMENT ALGORITHMS (FIFO) -

A Alphabetic Diomond V 1.0 -

A Fraction Calculator -

A Faster Way to “MOD” and how to grab a digit from an Integer -

C++ Datastructures and Algorithms -

An Introduction to Data Structures with C++

-

C++ Datastructures -

C++ Algorithms

-

Computer science C++ programs and source code by James Pate Williams, Jr. -

Cenelia Gonzales C++ sources -

Vivek Patel C++ Sources -

MTS-HOME -

Solving NonLinear Equations -

AVL Tree -

Huffman Coding (Encryption) -

Gauss Jordon -

Rational Number Class -

Tower of Hanoi -

Fibonacci series -

fibonacci series using Toplogical Odering -

Prim’s Algorithm -

Prim’s Algorithm with Graphics -

Prim’s Algorithm -

Kurskal’s Algorithm -

Kurskal’s Algorithm -

Kurskal’s Algorithm with Graphics with Mouse Support -

Towers of Hanoi -

Blitz++ a C++ class library -

Sample codes for the data structures and algorithms mentioned in the book:
NEW (but not yet stable): C++ and Java codes.zip (latest update 24 January 2011)

PDF slides for coaches/instructors/lecturers/students who wants to do self-study:

Hello programmers, Today I would like to give you the links of  Robert Sedgewick’s Algorithm Lectures. Robert Sedgewick works in the Department of Computer Science, Princeton University, Princeton, NJ 08544

Below are links to the lecture slides. This list is tentative and is to be considered subject to change. Minor updates are possible at any time. Substantive updates (not unlikely the evening before a lecture) will be marked with the date of change. Here are the reported errata.

This file with all the slides for Lectures 1-10 (28 MB) is suitable for uploading to a portable device, as is this file with all the slides for Lectures 12-24 (40 MB) and this file with all the slides for the course (66 MB). These files do not reflect changes made as the semester progresses

Q. How to do better in Contests?

A. Very nice place to start is the TopCoder Algorithm Tutorials. They have some very good articles. But at the end of the day, you will need to study a good book on algorithms. The most popular one is CLRS (“Introduction to Algorithms” by Cormen et. al.). I would also recommend “Algorithm Design” by Kleinberg and Tardos.

Also, sites like TopCoder, Google Code Jam and CodeForces have problem analyses and the code submitted during the contest available. Reading those is a great way learning new techniques and approaches.….

Writer                                         Tutorials