Data Structure and algorithms   ( in Java ) Please solve it urgent basis: Make a programe in Java with complete comments detail and attach outputs image: Question is inside the image also:   a).  Write a function to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows: Insert 50                                      List:-    50 Insert 40                                     List:-    40        50        Insert 25                                    List:-    25        40        50 Insert 35                                     List:-    25        35        40        50 Insert 40                                      List:-    25        35        40        40        50 Insert 70                                       List:-    25        35        40        50        70

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Data Structure and algorithms   ( in Java )

Please solve it urgent basis:

Make a programe in Java with complete comments detail and attach outputs image:

Question is inside the image also:

 

a).  Write a function to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows:

Insert 50                                      List:-    50

Insert 40                                     List:-    40        50       

Insert 25                                    List:-    25        40        50

Insert 35                                     List:-    25        35        40        50

Insert 40                                      List:-    25        35        40        40        50

Insert 70                                       List:-    25        35        40        50        70

 

b).  Write a program to merge two sorted linked lists (implemented in part a) The input lists have their elements in sorted order, from smallest to highest. The output list should also be sorted from highest to lowest. Your algorithm should run in linear time on the length of the output list.

a. Write a program to insert elements in the sorted manner in the linked list. This means that
the elements of the list will always be in ascending order, whenever you insert the data. For
example, After calling insert method with the given data your list should be as follows:
List:- 50
List:- 40
List:- 25
List:- 25
List:- 25
List:- 25
Insert 50
Insert 40
50
Insert 25
40
50
w
Insert 35
35
40
50
Insert 40
35
40
40
50
Insert 70
35
40
50
70
b. Write a program to merge two sorted linked lists (implemented in part a). The input lists have
their elements in sorted order, from smallest to highest. The output list should also be sorted
from highest to lowest. Your algorithm should run in linear time on the length of the output
list.
Transcribed Image Text:a. Write a program to insert elements in the sorted manner in the linked list. This means that the elements of the list will always be in ascending order, whenever you insert the data. For example, After calling insert method with the given data your list should be as follows: List:- 50 List:- 40 List:- 25 List:- 25 List:- 25 List:- 25 Insert 50 Insert 40 50 Insert 25 40 50 w Insert 35 35 40 50 Insert 40 35 40 40 50 Insert 70 35 40 50 70 b. Write a program to merge two sorted linked lists (implemented in part a). The input lists have their elements in sorted order, from smallest to highest. The output list should also be sorted from highest to lowest. Your algorithm should run in linear time on the length of the output list.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Concept of memory addresses in pointers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education