Group A: Arrays and Searching Sorting Algorithms (Assignment No 02)

Problem Statement:

In an e-commerce system, customer account IDs are stored in a list, and you are tasked with writing a program that implements the following: 

•LinearSearch: Check if a particular customer account ID exists in the list. 

•BinarySearch: Implement BinarySearch to find if a customer account ID exists, improving the search efficiency over the basic linear search. 

Implementation of Python Program is as Follows:

Queue operation and its types (Circular, Multi, Linked, Deque, Priority)

Reference: Computer architecture - Wikipedia

 Implementation of Fibonacci Search Algorithm:

 Radix Sort

Count Sort

 Non Comparison Based Sorting

Count Sort:

 Fast Transpose of Sparse Matrix

 Simple Transpose of Sparse Matrix

 Sparse Matrix Multiplication..