Conclusion references data structure and algorithms

Running head: DATA STRUCTURE AND ALGORITHMS

DATA STRUCTURE AND ALGORITHMS

DATA STRUCTURE AND ALGORITHMS
Executive Summary

An insurance company is currently dealing with lots of customers which is making their daily tasks quite difficult to do. They are using the traditional approach for recording the details of their customers which results in time loss and money. Because of that, a computerised system has been thought, which will not only records the data of the customers, but will also perform various activities. The system will be implemented based on the OOPs concept using the knowledge of data structure.

2. Background....................................................................................................................3

3. Case Study and Design....................................................................................................3

4. Conclusion......................................................................................................................3

References.........................................................................................................................4

2. Background

Based on the previous section of the report the purpose of implementing such kind of system has been cleared. The system can be named the insurance management system because of its purpose. The most common and preferable programming approach has been considered which is Object-Oriented Programming because of its easy implementation and understandability. For this purpose, the algorithm method has been used which will help the staff of the company to store a large amount of data which is the records of the customer

Binary Search:

In order to search the most efficient and appropriate algorithm is the binary search algorithm. This method of the algorithm is used to search the data which is already there in the sorted data list (Balogun 2020). The logic behind the algorithm is that the sorted list gets divided repeatedly into half of the portion of the list available. The whole process gets continuously repeated until the possible location are combined into one. This algorithm

3.1. Variables, Ranges, and Keys

To perform any operation in the proposed insurance management system, first, it is important to records the customer's details and their policy details. The details include the name, age, address, contact number, health condition, and policy number. But to be able to

possible by using the most common function “array”. But to declare the function, their size

needs to be also declared in order to prevent loss of memory space. So, to prevent this it is

 Customer_name

 Address

 Policy_number

 Customer_id

Based on the case study and the above sections of the report it has been cleared that

there are a total of two main tasks that the company wants to perform on the proposed

3.3. Algorithm and Justification

Algorithm for Merge Sort:

array[m+1…..right], and the array[1…..m] firstly get sorted so that they can be merged into 2

sub-arrays that get combined later into one (Marszałek 2017).

Afer the end statement gets fulfilled, the -1 gets achieved from the return program. Once it gets done the program will know that there are no results in the previous array list and for this, a message will get displayed (Khatami and Salehipour 2020).

3.4. Modification

The insurance management system can be the most successful implementation for the company based on the management of a huge amount of data. Traditional approaches were good back then first due to the rapid growth of technologies and customers the approach seems to be inappropriate. The new system will provide the capability to perform various operations anytime they want within a few seconds.

Lippuner, J., 2019. C++ Introduction and Best Practices (No. LA-UR-19-26916). Los Alamos National Lab.(LANL), Los Alamos, NM (United States).

Lokare, V.T., Jadhav, P.M. and Patil, S.S., 2018. An integrated approach for teaching object oriented programming (c++) Course. Journal of Engineering Education Transformations, 31(3), pp.17-23.

Shabaz, M. and Kumar, A., 2019. SA sorting: a novel sorting technique for large-scale data. Journal of Computer Networks and Communications, 2019.