Post your C/C++ Programs Here

[Liverpool_fan]

Originally Posted by vickybat

Suggest me what to do mate??

Try Geany. Make sure your paths are configured, and g++ and gcc works from the command line.

Originally Posted by vickybat

Oh got it mate. Thanks for that. I will modify the code accordingly.

I guess a switch case to check vowels will do isn't it?
And to do that we have to check each and every character of the string.
Loops will also be needed.

STL will make it much simpler. (Not necessarily most efficient).

[somulesnar]

@ neuron

sorry buddy actually i was on the wrong path......thnx for making me realise the actual piglatin concept. I will too try my level best to write on the way u told...........

one more help can u plz check out the bubble sort program of mine mentioned earlier and write me the same using recursion......

[Garbage]

Originally Posted by somulesnar

@ neuron
one more help can u plz check out the bubble sort program of mine mentioned earlier and write me the same using recursion......

You should not ask someone else to write a program for you if you want to "learn" programming.

[somulesnar]

^^ buddy i have already mentioned that i am a novice in c c++ programming language.

Yet if i am wrong then plz atleast plz suggest me the logic that i shud use for the stated program...

[mitraark]

Originally Posted by somulesnar

^^ buddy i have already mentioned that i am a novice in c c++ programming language.

Yet if i am wrong then plz atleast plz suggest me the logic that i shud use for the stated program...

I know this might feel a little harsh but never try to get your homework done from Net instead if you go through the book trying to find the answer you;ll leanr not only that but many other important things as well.

Since you are trying to get Bubble Sort using recursion , you can definitely start to read up on "Recursion" chapter in the C / C++ Book you got.

[Garbage]

A bit offtopic, but I found this site interesting - Computational Fairy Tales: Posts by Topic

It teaches algorithm like a fairy tales.

And this site visualize the different sorting algorithms - Sorting Algorithm Animations

[somulesnar]

Originally Posted by mitraark

I know this might feel a little harsh but never try to get your homework done from Net instead if you go through the book trying to find the answer you;ll leanr not only that but many other important things as well.

Since you are trying to get Bubble Sort using recursion , you can definitely start to read up on "Recursion" chapter in the C / C++ Book you got.

@ mitraark

if i wud rely mostly on books then for what is this thread made for. It is made for the learners in c and c++ programmers. So if u have learned enough of it then my kind request to u is to plz stop posting unnecessary posts into it. If u r not willing to help then its well and fine.

BTW i didnt ask my prob to u personally i asked to the members who are willing to help me with my prob. So plz stop commenting on others posts.....

[mitraark]

Originally Posted by somulesnar

@ mitraark

if i wud rely mostly on books then for what is this thread made for. It is made for the learners in c and c++ programmers. So if u have learned enough of it then my kind request to u is to plz stop posting unnecessary posts into it. If u r not willing to help then its well and fine.

BTW i didnt ask my prob to u personally i asked to the members who are willing to help me with my prob. So plz stop commenting on others posts.....

I am sorry but i did not mean to have offended you in any way. It is just that the problem you presented is a textbook problem of recursion , probably every book out there that covers Recursion has the answers as an example. So i thought maybe a book will come in handy for you

[somulesnar]

^^ its alright buddy. Actually ur post started of with an irritating take off. U r right in ur point but the thing is that i am on the go so i dont have any books on with me so plz co-operate.

[Liverpool_fan]

You don't have books, but you can always google.
Anyway your problem is with recursion concept and just this problem?

[somulesnar]

^^ yes of course i searched a lot of sites but cant get a proper one for the above program....

All the codes are written in the sites in more or less C++ language wich i am not friendly with. So plz help..

[Garbage]

Originally Posted by somulesnar

@ mitraark

if i wud rely mostly on books then for what is this thread made for. It is made for the learners in c and c++ programmers. So if u have learned enough of it then my kind request to u is to plz stop posting unnecessary posts into it. If u r not willing to help then its well and fine.

BTW i didnt ask my prob to u personally i asked to the members who are willing to help me with my prob. So plz stop commenting on others posts.....

Mind you, this thread is NOT made for asking to solve your homework questions directly, without even reading books or searching Google.
People who ask for help without even trying are not *learners*.
I would say, this is a very bad attitude towards learning and towards the community.

And I think you need to read through following link BEFORE you ask any more questions. It would help you in your online stay.

How To Ask Questions The Smart Way

Before asking a technical question by e-mail, or in a newsgroup, or on a website chat board, do the following:

• Try to find an answer by searching the archives of the forum you plan to post to.
• Try to find an answer by searching the Web.
• Try to find an answer by reading the manual.
• Try to find an answer by reading a FAQ.
• Try to find an answer by inspection or experimentation.
• Try to find an answer by asking a skilled friend.
• If you're a programmer, try to find an answer by reading the source code.

[somulesnar]

^^ ok fine i ll first try to sort out tjis question wen i return home then ill post in this thread... till then good bye TDF members....

[asingh]

Guys....have we gone nuts in the head or what...? How can you ascertain that it is homework which is being requested here. And if it is..? So..? The world has changed, if a problem is assigned to a student the teacher know quite well that external sources can be looked upon. Day of reckoning comes when the person takes a test behind 4 walls.

So let us not be so condescending and try to deter members when they ask queries. I personally have created SQL queries and Excel spreadsheets and MDB DB's for users whose handle ID was all I knew..?

If someone does not want to help, they can at least guide or explain a couple of concepts. Somulesnar, started his post with a decent code snippet, so it is not that he is asking TDF to do the work.

Thanks.

[Liverpool_fan]

somulesnar

Answer this.

Originally Posted by Liverpool_fan

Anyway your problem is with recursion concept and just this problem?

[Garbage]

Originally Posted by asingh

Guys....have we gone nuts in the head or what...? How can you ascertain that it is homework which is being requested here. And if it is..? So..? The world has changed, if a problem is assigned to a student the teacher know quite well that external sources can be looked upon. Day of reckoning comes when the person takes a test behind 4 walls.

So let us not be so condescending and try to deter members when they ask queries. I personally have created SQL queries and Excel spreadsheets and MDB DB's for users whose handle ID was all I knew..?

If someone does not want to help, they can at least guide or explain a couple of concepts. Somulesnar, started his post with a decent code snippet, so it is not that he is asking TDF to do the work.

Thanks.

If it would have been *only* about solving the problem and NOT about learning, then I am 100% agree with you. But I am sure, just solving the problem for someone will not help that someone in learning. Will it?

[sakumar79]

^^ Exactly - If the OP posts sample code of what he/she has tried and the problems faced, setting them on the right path helps the OP understand where the mistake is and this transforms the original failure to solve the problem into a learning process. When the OP had earlier asked help in sorting out the piglatin problem, there were useful suggestions given to help the OP in getting to the solution. That is the right way to help the OP learn IMHO...

Arun

[somulesnar]

@ asingh

Thnx a lot sir. The same thing i was trying to convey to the other members but i think they didnt get tht perfectly. Anyways i would try to solve this prob myself and if i cant i will let u know guys....

Cheers....

Originally Posted by Liverpool_fan

somulesnar

Answer this.

yes my prob is with the recursion concept of this prob only...

[vickybat]

Originally Posted by asingh

Guys....have we gone nuts in the head or what...? How can you ascertain that it is homework which is being requested here. And if it is..? So..? The world has changed, if a problem is assigned to a student the teacher know quite well that external sources can be looked upon. Day of reckoning comes when the person takes a test behind 4 walls.

So let us not be so condescending and try to deter members when they ask queries. I personally have created SQL queries and Excel spreadsheets and MDB DB's for users whose handle ID was all I knew..?

If someone does not want to help, they can at least guide or explain a couple of concepts. Somulesnar, started his post with a decent code snippet, so it is not that he is asking TDF to do the work.

Thanks.

Even i mostly agree to this.

[asingh]

Originally Posted by Garbage

If it would have been *only* about solving the problem and NOT about learning, then I am 100% agree with you. But I am sure, just solving the problem for someone will not help that someone in learning. Will it?

He had posted some code, so telling him what was wrong would help. See if someone has expertise why not tell..?

Originally Posted by sakumar79

^^ Exactly - If the OP posts sample code of what he/she has tried and the problems faced, setting them on the right path helps the OP understand where the mistake is and this transforms the original failure to solve the problem into a learning process. When the OP had earlier asked help in sorting out the piglatin problem, there were useful suggestions given to help the OP in getting to the solution. That is the right way to help the OP learn IMHO...

Arun

If at times someone is not getting it..we can nudge him and give more specific answers. That is how it works...at least I thought so when teaching stuff about programming.

[Liverpool_fan]

All right.
First of all Bubble Sort is not exactly the most naturally expressed in recursive algorithm. However any iterative algorithm can be made recursive crudely at least. Is the following you desire?

I would still say at least iteratively compare the adjacent items in the function send_max_to_rear, the resulting code stuck with recursion only is very clumsy in my opinion, unless someone does it better.

Spoiler:

PHP Code:


#include <stdio.h>

#define LEN 25

void send_max_to_rear(int *l, int pos, int len); 
void pass(int *l, int len); 

int main(void)    {
    int i;
    int list[LEN];

    for(i = 0; i < LEN; ++i)    {
        printf("Enter for %d: ", i+1);
        scanf("%d", &list[i]);
    }

    pass(list, LEN);

    for(i = 0; i < LEN; ++i)    {
        printf("%d ", list[i]);
    }
    puts(""); // Put a newline at the end of program's stdin

    return 0;
}

void send_max_to_rear(int *l, int pos, int len)    {
    /*
        This function sends the largest member of the sublist to the rear.
    */
    
    /* Compare the members at `pos` and `pos+1` and swap if necessary */
    if (l[pos] > l[pos+1])    {
        int temp = l[pos];
        l[pos] = l[pos+1];
        l[pos+1] = temp;
    }

    /* As long as there are two elements to compare in the (sub)list, call compare the next two elements. */
    if (pos < len - 2)    {
        send_max_to_rear(l, pos+1, len); // Move to the next position to compare.
    }
}

void pass(int *l, int len)    {
    /*
        This function recursively calls unsorted part of the list, after each pass.
    */

    /* As long as array is has two unsorted elements, bubble sort it. */
    if (len > 1    )    {
        send_max_to_rear(l, 0, len);
        pass(l, len - 1);
    }
} 


P.S.: Divide and Conquer based algorithms are more suitable for recursive implementation, I'll suggest try QuickSort.

P.P.S.: Double test the code just in case, sleepy head you know.

[somulesnar]

^^ thnx a lot. Ok now i got the right logic. Thnx for everything guys.

Cheers...

[clmlbx]

Guys, Here is my Programme to calculate Pixel per Inch(ppi) of any screen with Classes in different files.

// this is main.cpp, actual Programme (Name = main.cpp)

#include <iostream>
#include "PPI.h"

using namespace std;

int main()
{
    PPI ppiobj;
    ppiobj.Welcome();
    ppiobj.GetData();
    ppiobj.Calculateppi();
    ppiobj.Output();

}

// this is class File/self made header File./ where everything is Declared (Name is = PPI.h)


#ifndef PPI_H
#define PPI_H


class PPI
{
    public:

        PPI();
        void Welcome();
        void GetData();
        void Calculateppi();
        void Output();
        ~PPI();
    protected:
    private:
        int Width;
        int Height;
        int DR;
        float  ppi;
        float root;
        float Size;
};

#endif // PPI_H

// This is where all class Function is Defined..(Name = PPI.cpp)

#include "PPI.h"
#include <iostream>
#include <math.h>
#include<iomanip>

using namespace std;

PPI::PPI()
{
    //ctor
}

void PPI::Welcome(){

    cout<<setw(40)<<"Welcome"<<endl<<endl;
    cout<<"This Programme Will help you to calculate Pixel Per Inch (PPI) Of your screen"<<endl ;
    cout<<"\n\nThings you should have : "<<endl<<endl<<"1. Resloution"<<endl<<"2. Size of Screen in Inches"<<endl;

}

void PPI::GetData()
{

cout<<"\n\nEnter Resolution in this Format (1280 720) ::  ";
cin>> Width>> Height;

cout<<endl<<"\nEnter sice Of screen ::   ";
cin>>Size;
}


void PPI::Calculateppi(){

DR = (Width * Width) + (Height * Height);

root= sqrt(DR);

ppi = root/Size;


}


void PPI:: Output(){

cout<< "\n\nPPI of your Screen is :: " <<ppi<<endl;
}


PPI::~PPI()
{
    cout<<"\n\n Thank You for using this Programme."<<endl;
    cout <<"\n\nFor any feedback Pls Contact :: feedback@No-one.com";
}

Edit: oops I find out My own mistake.. I made constructor and that Welcome Data was supposed to be in Constructor function.. but while Writing I code I made another Function for it (welcome Function)

[somulesnar]

hey guys here's a c program to merge two single linked lists.... i ve used switch case to get on over wid this prob can u suggest me an easier way....

Spoiler:

#include<stdio.h>
#include<conio.h>
#define null 0
void create();
void display();
void insert();
void delet();
void erase();
void create2();
void display2();
void insert2();
void delet2();
void erase2();
void link1();
void link2();
void merge();
struct node
{
int info;
struct node *next;
}*start,*ptr,*temp,*prev;
struct node2
{
int info;
struct node2 *nex;
}*start2,*ptr2,*temp2,*prev2;
void main()
{
int op;
clrscr();
do
{
printf("\n1.link1\n2.link2\n3.merge\n4.exit");
printf("\nEnter your option");
scanf("%d",&op);
switch(op)
{
case 1:
link1();
break;
case 2:
link2();
break;
case 3:
merge();
break;
case 4:
break;
default:
printf("\nEnter correct option");
}
}while(op!=4);
getch();
}
void create()
{
int data;
printf("\nEnter the data");
scanf("%d",&data);
do
{
ptr=malloc(sizeof(struct node));
ptr->info=data;
ptr->next=NULL;
if(start==NULL)
start=ptr;
else
{
temp=start;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=ptr;
}
printf("\nEnter the data & Press 0 to terminate");
scanf("%d",&data);
}while(data!=0);
}
void display()
{
temp=start;
if(start==NULL)
printf("\nList is empty");
else
{
printf("\nElements of list:\n");
while(temp->next!=NULL)
{
printf("%d\t",temp->info);
temp=temp->next;
}
printf("%d\t",temp->info);
}
}
void insert()
{
int data,pos;
printf("\nEnter data & position to insert the element");
scanf("d",&data,&pos);
temp=start;
ptr=malloc(sizeof(struct node));
ptr->info=data;
while(temp->next!=NULL)
{
if(temp->info==pos)
{
ptr->next=temp->next;
temp->next=ptr;
break;
}
else
temp=temp->next;
}
if(temp->next==NULL)
{
temp->next=ptr;
ptr->next=NULL;
}
}
void delet()
{
int pos,flag=0;
if(start==NULL)
printf("List is empty");
else
{
printf("Enter element to be deleted");
scanf("%d",&pos);
temp=start;
if(start->info==pos)
{
flag=1;
start=start->next;
free(temp);
}
else
{
while(temp->next!=NULL)
{
prev=temp;
temp=temp->next;
if(temp->info==pos)
{
flag=1;
prev->next=temp->next;
free(temp);
break;
}
}
}
if(flag==0)
printf("\nElement is not present in list");
}
}
void erase()
{
if(start==NULL)
printf("\nList is empty");
else
{
while(start->next!=NULL)
{
temp=start;
start=start->next;
free(temp);
}
temp=start;
start=start->next;
free(temp);
printf("list is erased");
}
}
void create2()
{
int data;
printf("\nEnter the data");
scanf("%d",&data);
do
{
ptr2=malloc(sizeof(struct node2));
ptr2->info=data;
ptr2->nex=NULL;
if(start2==NULL)
start2=ptr2;
else
{
temp2=start2;
while(temp2->nex!=NULL)
{
temp2=temp2->nex;
}
temp2->nex=ptr2;
}
printf("\nEnter the data & Press 0 to terminate");
scanf("%d",&data);
}while(data!=0);
}
void display2()
{
temp2=start2;
if(start2==NULL)
printf("\nList is empty");
else
{
printf("\nElements of list:\n");
while(temp2->nex!=NULL)
{
printf("%d\t",temp2->info);
temp2=temp2->nex;
}
printf("%d\t",temp2->info);
}
}
void insert2()
{
int data,pos;
printf("\nEnter data & position to insert the element");
scanf("d",&data,&pos);
temp2=start2;
ptr2=malloc(sizeof(struct node2));
ptr2->info=data;
while(temp2->nex!=NULL)
{
if(temp2->info==pos)
{
ptr2->nex=temp2->nex;
temp2->nex=ptr2;
break;
}
else
temp2=temp2->nex;
}
if(temp2->nex==NULL)
{
temp2->nex=ptr2;
ptr2->nex=NULL;
}
}
void delet2()
{
int pos,flag=0;
if(start2==NULL)
printf("List is empty");
else
{
printf("Enter element to be deleted");
scanf("%d",&pos);
temp2=start2;
if(start2->info==pos)
{
flag=1;
start2=start2->nex;
free(temp2);
}
else
{
while(temp2->nex!=NULL)
{
prev2=temp2;
temp2=temp2->nex;
if(temp2->info==pos)
{
flag=1;
prev2->nex=temp2->nex;
free(temp2);
break;
}
}
}
if(flag==0)
printf("\nElement is not present in list");
}
}
void erase2()
{
if(start2==NULL)
printf("\nList is empty");
else
{
while(start2->nex!=NULL)
{
temp2=start2;
start2=start2->nex;
free(temp2);
}
temp2=start2;
start2=start2->nex;
free(temp2);
printf("list is erased");
}
}
void link1()
{
int op;
start=NULL;
do
{
printf("\n1.create\n2.display\n3.insert\n4.delete\ n5.erase\n6.exit");
printf("\nEnter your option");
scanf("%d",&op);
switch(op)
{
case 1:
create();
break;
case 2:
display();
break;
case 3:
insert();
break;
case 4:
delet();
break;
case 5:
erase();
break;
case 6:
break;
default:
printf("\nEnter correct option");
}
}while(op!=6);
getch();
}
void link2()
{
int op;
start2=NULL;
do
{
printf("\n1.create\n2.display\n3.insert\n4.delete\ n5.erase\n6.exit");
printf("\nEnter your option");
scanf("%d",&op);
switch(op)
{
case 1:
create2();
break;
case 2:
display2();
break;
case 3:
insert2();
break;
case 4:
delet2();
break;
case 5:
erase2();
break;
case 6:
break;
default:
printf("\nEnter correct option");
}
}while(op!=6);
getch();
}
void merge()
{
if(start==NULL)
{
start=start2;
}
else
{
temp=start;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=start2;
}
temp=start;
if(start==NULL)
printf("\nList is empty");
else
{
printf("\nElements of list:\n");
while(temp!=NULL)
{
printf("%d\t",temp->info);
temp=temp->next;
}
}
getch();
}

[raj100]

#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
int save,number,digit,count=0,rev=0,m,n,save2;
clrscr();
printf("Enter number to print=");
scanf("%d",&number);
save=number;
save2=number;
while(number!=0)
{
m=number%10;
digit=m/m;
count=count+digit;
number=number/10;
}
printf("\n %d",count);
while(save!=0)
{
n=save%10;
rev=rev+pow(n,count);
save=save/10;
}
printf("\n %d",rev);
if(rev==save2)
{
printf("\nEnter number is Armstrong");
}
else
{
printf("\nEnter number is not armstrong");
}
getch();
}

[nims11]

Spoiler:

Originally Posted by raj100

#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
int save,number,digit,count=0,rev=0,m,n,save2;
clrscr();
printf("Enter number to print=");
scanf("%d",&number);
save=number;
save2=number;
while(number!=0)
{
m=number%10;
digit=m/m;
count=count+digit;
number=number/10;
}
printf("\n %d",count);
while(save!=0)
{
n=save%10;
rev=rev+pow(n,count);
save=save/10;
}
printf("\n %d",rev);
if(rev==save2)
{
printf("\nEnter number is Armstrong");
}
else
{
printf("\nEnter number is not armstrong");
}
getch();
}

live in present buddy!

[priyaranjan]

Originally Posted by Ron

scanf("%d%d%d",&a,&b,&c);
New to c++.......Whta those this line means

scanf() takes input from standard input(key board) and stores in some variables.

%d is called format specifier for integer variable, it tells compiler that coming input from the keyboard is an integer .

next is &a , this is the address of the variable "a" which needs to be passed to the scanf()
to store the input data in variable "a".

so by combing all compiler now knows that input data needs to be stored in an integer variable and the variable is a.

now in your question there are three inputs coming from your key board so you have 3 %d and the three address of the variables that is &a,&b,&c.