I'm sorry if this is a stupid question but can't create linked list on paper with pencil
I have decided to make flow chart first for linked list . I know pointer, structure and dynamic memory allocation are the three basic features of linked list. I understand all those three but I can't figure out on paper for linked list
I do not have any idea to create flow chart for linked list.
somebody please help me How to represent basic block of linked list in flow chart.
Thanks in advance.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I can get a lot of source codes but I am asking suggestion for flow chart.Originally Posted by Salem
Take a look this example
How to make flow chart for this operation
I found this link by searching on "linked list pseudocode"; Likes like good pseudocode to me.
Linked Lists: The Basics
NOTE: This is not a website that does your homework!
Tim S.
"...a computer is a stupid machine with the ability to do incredibly smart things, while computer programmers are smart people with the ability to do incredibly stupid things. They are,in short, a perfect match.." Bill Bryson
> How to make flow chart for this operation
What operation?
How to create it?
How to traverse it?
How to delete it?
Make a flow chart of this
while ( node != NULL ) node = node->next;
This is at the heart of every linked list operation, because it is how you traverse the list.
Adding, deleting, searching are just decorations of that.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I know it's not complete flow chart and I need to improve it but It's my best attempt to make flow chart
How to improve above flow chart any suggestion would appreciate on flow chart
You have a backward pointing arrow to make a loop.
You have a "False" coming out of your <> diamond to get out of that loop.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
okay I have corrected points
How to make it batter
No it's not right at all.
False EXITS the loop.
True does some work, does node = node->next and jumps back to the test.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
okay modified version
Your true loop needs to end up pointing back at the <>
You've got it pointing back at "set pointer to the head of the list".
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
It's a linked list; i.e. essentially the most elementary data structure/abstract data type known to the human species. Perhaps you should buy a book. I shudder in horror trying to imagine what will happen when you get to doubly-linked lists or, god forbid, trees.
okay Now I need to draw flow chart to print node. How to go for next steps
once flow chart will complete I will try to write code
Between the <> and [next] activity, you put a [work] activity box.
Work being whatever it is you want to do with a node in your list.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
