Let L=(X1, X2Xn) be a list of n elements. Let us search for a key K in the list L. If the key is presented in the list L at index(or position); then partition the list Linto disjoint lists L1 and L2 such that L1=(x[i]: x[i]EL such that isj) and L2=(x[1]:x[i] EL such that i>j). If the key is not present in the list output is "no". Write an algorithm (using linked list) and subsequent C program for your algorithm to compute lists L1 and L2 for the given list L and key K. Note: Don't use any inbuilt functions in your program. Example1: If L=(16, 15, 1, 27, 19, 100, 200,3) and key k= 27 then L1=(16, 15,1,27) and L2=(19, 100,200, 3). Example 2: If L=(16, 15, 1, 27, 19, 100, 200,3) and key k= 127 then no. Input format Enter the list size n Enter the n numbers Enter the key value

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...
icon
Related questions
Question

Let L=(X1, X2Xn) be a list of n elements. Let us search for a key K in the list L. If the key is presented in the list L at index(or position); then partition the list Linto disjoint lists L1 and L2 such that

L1=(x[i]: x[i]EL such that isj) and L2=(x[1]:x[i] EL such that i>j). If the key is not present in the list output is "no". Write an algorithm (using linked list) and subsequent C program for your algorithm to compute lists L1 and L2 for the given list L and key K. Note: Don't use any inbuilt functions in your program.

Example1: If L=(16, 15, 1, 27, 19, 100, 200,3) and key k= 27 then L1=(16, 15,1,27) and L2=(19, 100,200, 3).

Example 2: If L=(16, 15, 1, 27, 19, 100, 200,3) and key k= 127 then no.

Input format

Enter the list size n

Enter the n numbers

Enter the key value

Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
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