Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
In this code the x is int ...Please modify the condition if x will be char  .. for(p=*head; p!=NULL && x>p->info; p=p->next) we should change only this:  x>p->info    ( maybe we need to use the ASCII code?)

In this code the x is int ...Please modify the condition if x will be char  .. for(p=*head; p!=NULL && x>p->info; p=p->next) we should change only this:  x>p->info    ( maybe we need to use the ASCII code?)

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
100%

In this code the x is int ...Please modify the condition if x will be char  ..

for(p=*head; p!=NULL && x>p->info; p=p->next)

we should change only this:  x>p->info  

 ( maybe we need to use the ASCII code?)

 

 

Operation place insert an element x into sorted linear linked list structure. Where head points to a sorted list and x is an element to be inserted into its proper position within the list. void place(NODEPTR *head , int x) { NODEPTR p, q; q= NULL; for(p=*head; p!=NULL && x>p->info; p=p->next) q= p; if (q == NULL) /* insert x at the head of the list */ {p=getnode() p->info=x; p->next = head; head=p; } Else{ p=getnode(); p->info=x; p->next=q->next; q->next=p; } }
Transcribed Image Text:Operation place insert an element x into sorted linear linked list structure. Where head points to a sorted list and x is an element to be inserted into its proper position within the list. void place(NODEPTR *head , int x) { NODEPTR p, q; q= NULL; for(p=*head; p!=NULL && x>p->info; p=p->next) q= p; if (q == NULL) /* insert x at the head of the list */ {p=getnode() p->info=x; p->next = head; head=p; } Else{ p=getnode(); p->info=x; p->next=q->next; q->next=p; } }
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS