Jobs in Pune | Work better in teams | Socialize with friends | Submit Q&A | Tell a friend

Search site for 

• Implement an algorithm to insert in a sorted list.

   4,425 Views  |   (9 votes, avg: 4.33)

   Loading ...
    

Answers »

1. Submitted By: johny1 — October 6, 2006 +1 votes   + -

   bool sortedinsert(node* head, int val)
   {
   node* curr = head;
   while(curr)
   {
   if(curr->next)
   {
   if(curr->next.val > val)
   node* newnode = new node(val);
   newnode->next = curr->next;
   curr->next = newnode;
   return 1;
   }
   }
   return -1;
   }

3. Submitted By: jsheld — October 6, 2006 not yet rated   + -

   my solution (C++):

   void insert(int val){
   Node* prev, *curr = pHead;
   while (!curr && curr->value <= val){
   prev = curr;
   curr = curr->next;
   }
   if (!curr){
   if (!pHead){
   Node* temp = new Node(val);
   temp->next = pHead;
   pHead = temp;
   }
   else pHead = new Node(val);
   }
   else {
   Node *temp = new Node(val);
   temp->next = curr;
   prev->next = temp;
   }
   }

4. Submitted By: rdakka — October 6, 2006 not yet rated   + -

   void insert(node*& s, node* d, node* prev = 0)
   {
   if (s) {
   if (s->data > d->data) {
   d->next = s;
   if (prev) prev->next = d;
   return;
   }
   else insert(s->next, d, s);
   }
   else {
   ((prev) ? prev->next : s) = d;
   d->next = 0;
   }
   }

   insert(root, n1);
   insert(root, n2);

5. Submitted By: vijaysubramani — October 6, 2006 not yet rated   + -

   void insert(Node **NodePtr, Node *NewNode)
   {
   while(*NodePtr != NULL && *NodePtr-> Value > Value)
   {
   NodePtr = &(*NodePtr->Next);
   }
   NewNode->Next = *NodePtr!=NULL?*NodePtr:NULL;
   *NodePtr = NewNode;
   }

6. Submitted By: SP — September 25, 2007 not yet rated   + -

   struct node
   {
   int data;
   struct node * next;
   };

   void insert_order(struct node ** list, int val)
   {
   //construct a node out of value given
   struct node *newnode= getnode(); //return malloc(sizeof(struct node));
   newnode->data=val;
   newnode->next=null;

   //insert a node at proper position

   struct node *temp=list;
   if(temp==null){
   list=newnode;
   return;
   }
   struct node * prev=null;
   while(temp!=null && temp->data data )
   {
   prev=temp;
   temp=temp->next;
   }
   //insert new node netween prev and temp nodes
   prev->next=newnode;
   newnode->next=temp;
   return;
   }

7. Submitted By: S P — September 25, 2007 not yet rated   + -

   correction at one line
   while(temp!=null && temp->data data )

   read it as
   while(temp!=null && temp->data data )

8. Submitted By: Sneha — September 25, 2007 not yet rated   + -

   //structure of node
   struct node
   {
   int data;
   struct node * next;
   };

   void insert_order(struct node ** list, int val)
   {
   //construct a node out of value given
   struct node *newnode= getnode(); //return malloc(sizeof(struct node));
   newnode->data=val;
   newnode->next=null;

   //insert a node at proper position

   struct node *temp=list;
   if(temp==null){
   list=newnode;
   return;
   }
   struct node * prev=null;
   while(temp!=null && temp->data data )
   {
   prev=temp;
   temp=temp->next;
   }
   //insert new node netween prev and temp nodes
   prev->next=newnode;
   newnode->next=temp;
   return;
   }

10. Leave an Answer/Comment

    Name (required)

    Mail (will not be published) (required)

    Your Answer

    To prove you're a person (not a spam script), type the security text shown in the picture. Click here to regenerate some new text.
    

Contact Us | FAQ | Sitemap | Terms of Use | Privacy Policy | Tell a Friend

Copyright © 1999-2006 Jeeve Technologies LLC. All rights reserved.