Day: March 13, 2021

Python Example – Write a Python program to search a specific item in a singly linked list and return true if the item is found otherwise return false

(Python Example for Citizen Data Scientist & Business Analyst)   Write a Python program to search a specific item in a singly linked list and return true if the item is found otherwise return false.   Sample Solution: Python Code: class Node: def __init__(self, data=None): self.data = data self.next = None class singly_linked_list: def __init__(self): …

Python Example – Write a Python program to find the size of a singly linked list

(Python Example for Citizen Data Scientist & Business Analyst)   Write a Python program to find the size of a singly linked list.   Sample Solution: Python Code: class Node: def __init__(self, data=None): self.data = data self.next = None class singly_linked_list: def __init__(self): self.tail = None self.head = None self.count = 0 def append_item(self, data): …

Python Example – Write a Python program to create a singly linked list, append some items and iterate through the list

(Python Example for Citizen Data Scientist & Business Analyst)   Write a Python program to create a singly linked list, append some items and iterate through the list.   Sample Solution: Python Code: class Node: def __init__(self, data=None): self.data = data self.next = None class singly_linked_list: def __init__(self): self.tail = None self.head = None self.count …

Python Example – Write a Python program to sort a list of elements using Time sort

(Python Example for Citizen Data Scientist & Business Analyst)   Write a Python program to sort a list of elements using Time sort.   Sample Solution: Python Code: def binary_search(lst, item, start, end): if start == end: if lst[start] > item: return start else: return start + 1 if start > end: return start mid …

Python Example – Write a Python program to sort a list of elements using Selection sort.

(Python Example for Citizen Data Scientist & Business Analyst)   Write a Python program to sort a list of elements using Selection sort. According to Wikipedia “In computer science, selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse …