A

let's say we have an empty linked list.

###

**sorted linked list**is a list that has been sorted in order while implementing it. let's take an example to understand what is sorted linked list.let's say we have an empty linked list.

first, we insert the value 20 because the linked list is empty so we insert 20 as the first value.

after that, we insert value 10, and because the value of the first node is greater than 10 so we insert 10 before the value 20.

after that we insert the value 30 and because the 30 is greater than 20 so we insert it at last.

after that, we insert values 15 and 15 is greater than 10 but less than 20 so we insert 15 in between the values 10 and 20.

after that, we insert value 35, and 35 is greater than 30 so we insert it in last.

at last, we insert value 5, and because the value 5 is less than 10 so we insert it before the node that has value 10.

so this is the sorted linked list because the linked list is sorted in an order.

###
__Python program for implementing a sorted linked list.__

class Node(object): def __init__(self, value): self.info = value self.link = None class SortedLinkedList(object): def __init__(self): self.start = None def insert_in_order(self, data): temp = Node(data) if self.start is None or data < self.start.info: temp.link = self.start self.start = temp return p = self.start while p.link is not None and p.link.info <= data: p = p.link temp.link = p.link p.link = temp def create_list(self): n = int(input("Enter the number of nodes : ")) if n == 0: return for i in range(n): data = int(input("Enter the element to be inserted : ")) self.insert_in_order(data) def search(self, x): if self.start is None: print("List is empty") return p = self.start position = 1 while p is not None and p.info <= x: if p.info == x: break position += 1 p = p.link if p is None or p.info != x: print(x, " not found in list ") else: print(x, " is not position", position) def display_list(self): if self.start is None: print("List is empty") return print("List is : ") p = self.start while p is not None: print(p.info, " ", end='') p = p.link print() ################ list = SortedLinkedList() list.create_list() while True: print("1. Display list") print("2. Insert") print("3. Search for an element") print("4. Quit") option = int(input("Enter your choice : ")) if option == 1: list.display_list() elif option == 2: data = int(input("Enter the element to be inserted : ")) list.insert_in_order(data) elif option == 3: data = int(input("Enter the element to be searched : ")) list.search(data) elif option == 4: break else: print("Wrong option") print()

#### Also, read these posts

- What are Data Structures and algorithms
- Algorithm design and analysis
- Classification of algorithms
- How to calculate the running time of an algorithm.
- Worst Average and Best-case analysis of the algorithm.
- Big o notation
- Big o notation examples
- Linked List in Data Structures
- Traversing in Linked list
- Operations on the linked list
- Insertion in the linked list
- Deletion in a linked list
- Reversing a linked list
- Sorting a linked list
- Find and remove the loop in the linked list
- Doubly linked list
- Insertion in the doubly linked list
- Deletion in the doubly linked list
- Reversing a doubly linked list
- Circular linked list
- Insertion in the circular linked list
- Deletion in the circular linked list
- Merge two linked list
- Header linked list
- Stack in data structures
- Queue in data structures
- Circular queue
- Dequeue in the data structure
- Priority queue
- Polish notation
- Tree in the data structure
- Binary tree
- Array representation of the binary tree
- linked representation of a binary tree
- Traversing in the binary tree
- Inorder traversal in the binary tree
- Preorder traversal in the binary tree
- Postorder traversal in the binary tree
- Level order traversal in the binary tree
- Binary search tree
- Insertion in the binary search tree
- Deletion in the binary search tree
- Heap in data structures

- What are Data Structures and algorithms
- Algorithm design and analysis
- Classification of algorithms
- How to calculate the running time of an algorithm.
- Worst Average and Best-case analysis of the algorithm.
- Big o notation
- Big o notation examples
- Linked List in Data Structures
- Traversing in Linked list
- Operations on the linked list
- Insertion in the linked list
- Deletion in a linked list
- Reversing a linked list
- Sorting a linked list
- Find and remove the loop in the linked list
- Doubly linked list
- Insertion in the doubly linked list
- Deletion in the doubly linked list
- Reversing a doubly linked list
- Circular linked list
- Insertion in the circular linked list
- Deletion in the circular linked list
- Merge two linked list
- Header linked list
- Stack in data structures
- Queue in data structures
- Circular queue
- Dequeue in the data structure
- Priority queue
- Polish notation
- Tree in the data structure
- Binary tree
- Array representation of the binary tree
- linked representation of a binary tree
- Traversing in the binary tree
- Inorder traversal in the binary tree
- Preorder traversal in the binary tree
- Postorder traversal in the binary tree
- Level order traversal in the binary tree
- Binary search tree
- Insertion in the binary search tree
- Deletion in the binary search tree
- Heap in data structures

## 0 Comments