Question

ordered insertion on a ordered list

Asked by: Vasconcelos

i fixed the problems thanks :) but now i have a new question on ordered insertion on a ordered list.

void ordered_insert(void)
{
    NODE* new;
    NODE* ptemp;
    new = new_node();
    read_node(new);

    if(new <= first)
    {
        new->link = first;
        return new;
    }
    ptemp = first;
    while((new->data(?)ptemp->link] <= new->data) && (ptemp->link != NULL)) // in here how do get infomation of the info[link[ptemp]] using the correct c language :)
    {
        ptemp = ptemp->link;
    }
    new->link = ptemp->link;
    ptemp->link = new;
   // return first;

}

sorry for my bad english :)

This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.

Subscribe now for full access to Experts Exchange and get

Instant Access to this Solution

  • Plus...
  • 30 Day FREE access, no risk, no obligation
  • Collaborate with the world's top tech experts
  • Unlimited access to our exclusive solution database
  • Never be left without tech help again

Subscribe Now

Asked On
2009-11-20 at 10:01:45ID24918526
Tags

list

Topic

C Programming Language

Participating Experts
1
Points
500
Comments
12

Trusted by hundreds of thousands everyday for fast, accurate and reliable tech support.

  • "The time we save is the biggest benefit of Experts Exchange to Warner Bros. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange." Mike Kapnisakis, Warner Bros.
  • "Our team likes having a resource that is more secure than just using Google and most experts using this service really know their stuff. It's nice to look here first versus using Google." Dayna Sellner, Lockheed Martin
  • "Anytime that I've been stumped with a problem, 9 out of 10 times Experts Exchange has either the accepted solution or an open discussion of the potential solution to the problem." Kenny Red, eBay Inc.

See what Experts Exchange can do for you.

Got a question?

We've got the answer.

Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.

Screenshot of Experts Exchange Knowledgebase

Need individual assistance?

Our experts are ready to help.

If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.

Screenshot of Experts Exchange Knowledgebase

Want to learn from the best?

Read articles from industry experts.

Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.

Screenshot of an Article

Working on a long term project?

Store your work and research.

Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.

Screenshot of Experts Exchange Knowledgebase

Access the answers to your technology questions today.

Subscribe Now

30-day free trial. Register in 60 seconds.

What Makes Experts Exchange Unique?

Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.

Trusted by the world's most respected brands.

image of each brand's logo

Faithfully serving IT professionals since 1996.

Experts Exchange Logo

Try it out and discover for yourself.

Subscribe Now

30-day free trial. Register in 60 seconds.

Related Solutions

  1. void pointers
    Hi, Im having difficulties working with void pointer arguments and doubly linked lists containing data fiels of type void *. The below code works well with structures and strings, however, floats and ints escape me. the functions are to be generic, in that they are to be abl...
  2. insertion
    hi, i'm doing a BinarySearchTree program and i'm having a problem with the insertion method. the pseudocode for insertion was *void insert (TreeNode node, Object data) // Will insert data into an ordered binary tree. // The solution is recursive. { if ...
  3. Inserting a node in the middle of a Linked List with a dummy …
    What would be the best way to create a function that inserts a node into the middle of a linked list with a dummy node? Is there any advantage to using the dummy node? Also, in the same token, how would you create a function to delete a node in the middle of a linked list ...

Free Tech Articles

  1. WARNING: 5 Reasons why you should NEVER fix a computer for free.
    It is in our nature to love the puzzle. We are obsessed. The lot of us. We love puzzles. We love the challenge. We thrive on finding the answer. We hate disarray. It bothers us deep in our soul. W...
  2. SCCM OSD Basic troubleshooting
    SCCM 2007 OSD is a fantastic way to deploy operating systems, however, like most things SCCM issues can sometimes be difficult to resolve due to the sheer volume of logs to sift through and the dispe...
  3. Migrate Small Business Server 2003 to Exchange 2010 and Windows 2008 R2
    This guide is intended to provide step by step instructions on how to migrate from Small Business Server 2003 to Windows 2008 R2 with Exchange 2010. For this migration to work you will need the fo...
  4. Create a Win7 Gadget
    This article shows you how to create a simple "Gadget" -- a sort of mini-application supported by Windows 7 and Vista. Gadgets can be dropped anywhere on the desktop to provide instant information, ...
  5. Outlook continually prompting for username and password
    There have been a lot of questions recently regarding Outlook prompting for a username and password whilst using Exchange 2007. There are a few reasons why this would happen and I will try to cover t...
  6. Backup Exchange 2010 Information Store using Windows Backup
    There seems to be quite a lot of confusion around the ability to backup Exchange 2010 using the built in Windows Backup feature. This stems from the omission of this feature prior to Exchange 2007 s...

Cloud Class Webinars

  1. Avoiding Bugs in Microsoft Access
    Alison Balter takes and in-depth look at avoiding bugs in Access. In this webinar you will learn about using the immediate window to debug your applications, invoking the debugger, using breakpoints to troubleshoot, stepping through code, setting the next statement to execute, ...
  2. Top 10 Best New Features in Visio 2010
    Scott Helmers gives live demonstrations of the top 10 new features in Visio 2010. This webinar will teach you how to create compelling diagrams by adding shapes to the page with a single click, linking the shapes in a diagram to data in Excel (or SQL Server, or SharePoint), ...
  3. IT Consultant Business Secrets Revealed
    Michael Munger, Experts Exchange tech pro and IT consultant, pulls back the curtain on his very successful businesses and answers question on every IT consultant and business owner should know about. He shares secrets on what he did to solve the 5 most common problems in IT, ...
  4. Disaster Recovery and Business Continuity
    Quest CTO, Mike Billon, gives an overview of the steps involved in building a dunamic disaster recovery plan. Through case studies and an examination of software/hardware tooles for monitoring and testing, you'll gain a better understandin of where you are, where you want ...
  5. Organize Your Visio Diagrams with Containers and Lists
    Scott Helmers uses cross functional flowcharts, wireframe diagrams, data graphic legends and seating charts to teach you: how to ustilize all three new structured diagram components in Visio 2010, the best practices for organizeing shapes in previous version of Visio, how to organize ...
  6. How to Us Objects, Properties, Events and Methods in Microsoft Access
    Alison Dalter gives an in-depbth look at objects, properties, events and methods in Microsoft Access. In this webinar you will learn about using the object browser, referring to objects, working with properties and methods, working with object variables, understanding the ...

Join the Community

Give a Little. Get a Lot.

Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.

Join the Community

Answers

 

by: Infinity08Posted on 2009-11-20 at 10:22:06ID: 25872963

for information, this is a follow-up of http://www.experts-exchange.com/Programming/Languages/C/Q_24917520.html

>> but now i have a new question on ordered insertion on a ordered list.

And what's the question ?

 

by: VasconcelosPosted on 2009-11-20 at 10:41:59ID: 25873155

its writen on the code i dont know how to pass that to c the info of the ptemp->link :)

 

by: Infinity08Posted on 2009-11-20 at 10:50:35ID: 25873245

>>     if(new <= first)

Why are you comparing pointers like this ? There's no point, nor is it reliable. Maybe you intended to compare the data member of the node ?


>> // in here how do get infomation of the info[link[ptemp]]

Since 'data' is a char*, use strcmp to compare the data member of the new node with the data member of the current node :

         http://cplusplus.com/reference/clibrary/cstring/strcmp/

 

by: VasconcelosPosted on 2009-11-20 at 11:58:54ID: 25873919

void ordered_insert(void)
{
    NODE* new;
    NODE* ptemp;
    new = new_node();
    read_node(new);

    if(strcmp(new->data, prim->t)  can i do this?
    {
        new->link = first;
        return new;
    }
    ptemp = first;
    while((strcmp(new->data, ptemp->link)>0) && (ptemp->link != NULL))
    {
        ptemp = ptemp->link;
    }
    new->link = ptemp->link;
    ptemp->link = new;
   // return first;

}

is this correct? im kinda lost a bit here :P

 

by: Infinity08Posted on 2009-11-20 at 12:03:02ID: 25873963

>>     if(strcmp(new->data, prim->t)  can i do this?

What's prim-> t ?
You're also missing the actual <= check.


>>         return new;

The function is defined to return void ... so you can't return anything. Instead, you should probably set 'first' to point to the new node.


>>     while((strcmp(new->data, ptemp->link)>0) && (ptemp->link != NULL))

Here you're using strcmp to compare a char* with a NODE*. strcmp is used for comparing two char*'s.
Also, check whether ptemp->link is NULL BEFORE dereferencing it.


>> is this correct? im kinda lost a bit here :P

You're close :)

 

by: VasconcelosPosted on 2009-11-20 at 12:42:06ID: 25874327

void ordered_insert(void)
{
    NODE* new;
    NODE* ptemp;
    new = new_node();
    read_node(new);

    if(strcmp(new->data, prim->ptemp) <= 0)
    {
        new->link = first;
        return new;
    }
    ptemp = first;
    while((strcmp(new->data, ptemp->link) <= 0) && (ptemp->link != NULL))
    {
        ptemp = ptemp->link;
    }
    new->link = ptemp->link;
    ptemp->link = new;
    first = new;

}

how is it now? :)

 

by: Infinity08Posted on 2009-11-20 at 12:44:50ID: 25874358

What's prim->ptemp ?


>> how is it now? :)

Well you didn't fix everything I pointed out ...

 

by: VasconcelosPosted on 2009-11-20 at 12:46:12ID: 25874375

ups sorry its first->ptemp

 

by: Infinity08Posted on 2009-11-20 at 12:49:11ID: 25874396

>> ups sorry its first->ptemp

But first is of type NODE*, and a NODE doesn't have a ptemp data member.

 

by: VasconcelosPosted on 2009-11-21 at 05:59:27ID: 25877943

void ordered_insert(void)
{
    NODE* new;
    NODE* ptemp;
    new = new_node();
    read_node(new);    

    if(first == NULL)
    {
        new->link = NULL;
    }
    if(new->data <= first->data)
    {
        new->link = first;
    }
    ptemp = first;
    while(ptemp->link != NULL && strcmp(ptemp->link->data, new->data) < 0)
    {
        ptemp = ptemp->link;
    }
    new->link = ptemp->link;
    ptemp->link = new;
    first = new;
}

how is it now? :) sorry i suddenly disappeared from here, i went to the bar and each time i thought about this algorithm the more thirsty i got so...it didnt end well :P

 

by: Infinity08Posted on 2009-11-21 at 07:22:20ID: 25878223

lol. Well, I hope you have a fresh head now ;)

Ok, we're getting closer, but there's still some work to do.

You've correctly identified 3 cases :

(a) the linked list is empty, so we want the new node to be the first (and only) node in the linked list :

>>     if(first == NULL)
>>     {
>>         new->link = NULL;
>>     }

    This is good, but you still need to let 'first' point to the new node.

(b) the linked list is not empty, but the new node has to be inserted before the first node :

>>     if(new->data <= first->data)
>>     {
>>         new->link = first;
>>     }

    This is good, but again, you still need to let 'first' point to the new node.

(c) the linked list is not empty, and the new node has to be inserted somewhere in the middle of the list :

>>     ptemp = first;
>>     while(ptemp->link != NULL && strcmp(ptemp->link->data, new->data) < 0)
>>     {
>>         ptemp = ptemp->link;
>>     }
>>     new->link = ptemp->link;
>>     ptemp->link = new;

    This is good. The new node is inserted where it should. Nothing more needs to be done. In particular, the line you put after this code is not supposed to be there :

>>     first = new;



AND, another very important remark : the three cases you have identified need to be kept separate ! You can only execute one of the three pieces of code above, not all three. So, you'll need to have a bit of code like this :

if (/* case (a) */) {
  /* do whatever is necessary to handle case (a) */
}
else if (/* case (b) */) {
  /* do whatever is necessary to handle case (b) */
}
else {
  /* do whatever is necessary to handle case (c) */
}

                                              
1:
2:
3:
4:
5:
6:
7:
8:
9:

Select allOpen in new window

 

by: VasconcelosPosted on 2009-11-21 at 08:46:34ID: 31656775

Amazing thanks a million :)

20120131-EE-VQP-002

3 Ways to Join

30-Day Free Trial

The Experts

98% positive feedback on 31,087 answers since March 2000. angeliii is a Microsoft Most Valuable Professional for his work with MS SQL Server & Develoment.

He has also proven his knowledge of Visual Basic Programming, PHP Scripting and Oracle Databases.

The Experts

97% positive feedback on 10,752 answers since July 2000. lrmoore has more than 18 years experience in the networking industry.

The six-time Mircosoft MVPs specialties include firewalls, virtual private networking, and network management.

Testimonials

"...and excellent source for support... Kind of like having your very own IT dept." Electriciansnet

Testimonials

"I was apprehensive at signing up at first. However... it has already made my life as an IT administrator much easier." JaCrews

Testimonials

"WOW! You guys have great, active, and knowledgeable people on here." moore50

Business Clients

Business Clients

In the Press

"If you’ve got a question... Experts Exchange can supply an answer.”

In the Press

"...an invaluable aid for both IT professionals and those who require tech support."

In the Press

"where IT professionals provide quick answers on just about any topic"

Business Account Plans

Loading Advertisement...