Data Structures In C++ Tutorial, Writing Data Structures using OOP in C++ Options Rating

[theU]

Just out of curiousity ( because I'm new to all this) is "endl" the same as '\n'; ????

Please clarify. Thanx

[Bench]

Just out of curiousity ( because I'm new to all this) is "endl" the same as '\n'; ????

Please clarify. Thanx

in C++, cout << endl; is the equivalent of..

CODE

  cout << '\n';
  cout.flush();

For your purposes, you probably don't really care about the call to .flush() ... so feel free to use '\n' if you prefer.

[hir_sus_jp]

I'm learning many things from this tutorial. Thanks, born2c0de.

[hir_sus_jp]

I prefer endl to \n. When a program is working properly, it doesn’t matter which one you use. But when a program crashes, \n might mislead you. If there are any un-flushed data in the buffer when a program crashes, the un-flushed data can’t make it to the screen, or whatever destination. So what you see on the screen is not the actual output the program has written. You don't want to debug the code with the partial output.

This post has been edited by hir_sus_jp: 26 Oct, 2007 - 11:39 PM

[tody4me]

Very well documented tutorial. Once upon a time I wrote code in C++ and have been wanting to get back to it, but needed an understanding of how to store data properly before I picked it up again. I especially loved the in depth instructions for the Binary Search Tree, as I had only gotten to Linked Lists previously and always wondered exactly how they worked.

This post has been edited by tody4me: 18 Jan, 2008 - 10:12 AM

[born2c0de]

I'm glad you liked it

I'll be writing a sequel soon in which I plan to include more complex data structures (and their operations) as well so be sure to check the Tutorials section for updates.

[kamalharbi]

Real it's great to find like this site in the world
Really amazing
Thanks for helpfulness
Kamal Harbi

[cold-blood]

hi! thank you for your tutorial,.. it's a big help.. but can you help me on my project? It's about banking transaction system.. that keypad 1=open new account, 2=deposits, 3=withdraw, and 4 = close account.. I can make only one account.. but my prof. need 5 accounts.. can you help me.. plzzz!

This post has been edited by cold-blood: 18 Jul, 2008 - 04:12 AM

[KYA]

cold-blood please post in the appropriate forum for questions; it will help you get answers faster--also, show code you have done so far

[born2c0de]

I've *finally* removed the entire tutorial from the code tags and formatted it to give it a much cleaner look.
tutorial.readability+=50;

Enjoy!

[blacksnake]

can you show the basics of expression trees?

[casterden]

/*BINARY SEARCH PROGRAM BY SUMAIR IRSHAD*/
#include<stdio.h>
#include<conio.h>
void main(void)
{
clrscr();
int arr[]={1,3,5,7,9,11,13,15,17,19};
int i,target,start=0,end=10,mid;
printf("enter target");
scanf("%d",&target);
while(target!=arr[mid])
{
mid=(start+end)/2;
if(target==arr[mid])
{
break;
}
else if(target<arr[mid])
{
end=mid-1;
}

else if(target>arr[mid])
{
start=mid+1;
}
}
printf("target found at %dth location",mid+1);
getch();
}

[bonnie1702]

Hey there!

I'm new to c++ and new to this forum. I find the data structure tutorial very easy to read and understand. I haven't yet tried all the code yet. but I did do the one for stack (push and pop) and when I compiled, I got the error:

37 C:\c++Stuff\Stack.cpp [Warning] converting to non-pointer type `int' from NULL

I am using bloodshed's dev c++, so I thought I'd let you know that is whats happening. So if there is an error somewhere it would be nice to fix it. Does anyone else have any similar compilation errors with any of the code listed in the tutorial?

cheers
nm

[bonnie1702]

Hi, back again!

I fixed up the minor error in the stack class by replacing the NULL with 0. Now it compiles and runs fine.

I have since tried the queue class and there are a couple of minor typos ie., ensure that tmp is actually spelt temp, and in the second for loop in the main method, you need to declare iter as int iter; if you dont want keep typing the data type for every for loop, just declare it as a global in the main, like such: int iter.

After fixing up those, I ran the program and did not get the same output as in the example. this is what i got instead:

Queue before adding elements:
2000215017 0

Addition number: 1 : 2000215017 0 32
Addition number: 2 : 2000215017 0 32 23
Addition number: 3 : 2000215017 0 32 23 45
Queue is Full
Addition number: 4 : 2000215017 0 32 23 45
Queue is Full
Addition number: 5 : 2000215017 0 32 23 45

Queue after adding elements 2000215017 0 32 23 45

Deletion number: 1 : 0 32 23 45
Deletion number: 2 : 32 23 45
Deletion number: 3 : 23 45
Deletion number: 4 : 45
Deletion number: 5 : Empty

so there you have it.

has anyone else had any problem with the example code?

cheers all
nm

[ali khan]

I'm glad to know it helped you.

i have a pproblem in the topic escape sequences is there any 1 to help me?????????????????????

[naeem hassan]

/*BINARY SEARCH PROGRAM BY SUMAIR IRSHAD*/
#include<stdio.h>
#include<conio.h>
void main(void)
{
clrscr();
int arr[]={1,3,5,7,9,11,13,15,17,19};
int i,target,start=0,end=10,mid;
printf("enter target");
scanf("%d",&target);
while(target!=arr[mid])
{
mid=(start+end)/2;
if(target==arr[mid])
{
break;
}
else if(target<arr[mid])
{
end=mid-1;
}

else if(target>arr[mid])
{
start=mid+1;
}
}
printf("target found at %dth location",mid+1);
getch();
}

[bonnie1702]

Would be good if you could add to your tutorial some stuff on double linked lists

regards
NM

[KYA]

bonnie, I'll look into seeing if that would be worth its own tutorial.

[darkrut]

i have a problem! if the condition is true at the first while it works...but at the second "while" it doesn't delete the node that the condition is true for!thank you for helping me

CODE

//....
struct node  
{  
   string kelima;  
   int compteur;
   node *link;  
};// .........
void delnode(int n)
            {      node*temp;
                   node*teo;
                
                  
                  
                         while(top->compteur<n)
                         {  
                                top=top->link;if(top==NULL)break;
                         }temp=top;
                        
                          while(temp!=NULL)
                          { if(temp->compteur!=n)
                                {
                                teo=NULL;
                                 teo=temp->link;
                                
                                 temp=teo;
                                }
                             
                                    
                            else temp=temp->link;
                        }        
                        
                              
                            
             }

[violaris]

This is so great, I have passed my Data Structures midterm by only following this tutorial and practicing with it!