2.3.

4 Foreign Literature (follow the format from local literature

3.3.4.3 A-Pay Payroll System

According to Singh (2016), payroll is a critical operation for every organization to

pay employee accurately their salary and enrollments on time. Trouble free payroll

processing is a critical need of our business. Payroll software completes payroll

calculations within a fraction of time it would take to do them manually, whilst your

payroll staff may not like it, it makes perfect sense if you are trying to run a business.

Another huge advantage of running payroll software over a manual process is in the

reporting, most systems allow weekly, monthly, annually required reports to be run at

the press of a button. Instead of shuffling through endless files let the software do the

work. It is possible with lot of payroll software to integrate with your time sheet systems

that record employee attendance or time worked. It is a simple way for information

about employee hours worked to be transferred into the payroll system removing yet

another layer of manual processing. The proposed payroll system is a desktop-based

application for a college which is developed in Vb.net as front end and Microsoft Access

2007 with SQL Server 2008 as a back end. It manages the faculties’ personnel details,

pay bands, allowances, deductions and many other details. It has biometric machine for

attendance. The proposed payroll system provides individual pay receipts and

deduction voucher. It also has an option for backup and restore of all data just by click

of a button. The proposed payroll system is advantageous as it provides a user-friendly

environment and also increases security and minimizes human calculation errors
https://aip.scitation.org/doi/pdf/10.1063/1.5055526

https://www.ijrte.org/wp-content/uploads/papers/v8i2S2/B10280782S219.pdf

https://www.ijmter.com/papers/volume-3/issue-2/automated-payroll-system.pdf (2016)

https://ijarcce.com/upload/2015/january/IJARCCE1M.pdf (2015)

https://iopscience.iop.org/article/10.1088/1757-899X/662/2/022125 (2019)

https://www.academia.edu/33109997/Employee_Attendance_and_Payroll_System_Using_Image_Ca
pturing_and_GPS_Tracking (2017)

2.3.4.1 Quick Sort Algorithm – find the published one

According to Mehmood, a binary search is a way of finding an element 's location

in an ordered sequence. It continuously targets the middle element of the array and

verifies whether or not it finds its location as the target element. O (1) is the best case

complexity of binary search, while O(log n) is the average and worst case time

complexity, where 'n' is the number of array elements. In this paper, the researcher

proposed an algorithm that significantly enhances the complexity of the search

algorithm that outperforms binary search in the sorted array domain. The paper also

contrasts the proposed solution with other well-known search algorithms. The approach

presented minimizes the complexity of the space, removes the need to analyze the

scenario and look for the algorithm that best suits the problem given. The proposed

algorithm has constant space complexity (O(1)) and time complexity of O(1)

(constant time) in best case, O(log(log n)) in average case and O(log(n)) in worst

case. Thus, most of the time proposed algorithm works very well as compared to other

search algorithms in sorted array domain.

 In any case, the algorithm provided does not collapse. The type of data is not

affected, e.g. the data increases exponentially or the data increases with slightly

different variations. On average, it takes less iteration to search for an element in a data

structure compared to binary search and has no overhead space (does not use any

additional array other than searching array). Worst of all, it needs iterations that are

more or less equal to binary search. The algorithm presented is therefore the best

option for searching for an element in the structure of sorted data. [MEHM2019]

2.3.4.2 Sorting Algorithm should be place at the last part

Sorting issues are very prevalent in software development. For instance,

consumers also choose to view goods on an online shopping website, from the lowest

price to the highest price. It is necessary to use a fast sorting algorithm when a

computer system has a considerably large number of elements that need to be sorted.

Quicksort is mainly used as it has low time complexity and high memory consumption

efficiency. In computer systems and even in everyday life, sorting problems are a form

of common challenge. A list of sorted records also needs to be accessed by computer

users. For example, the distribution of prices for goods in an online store. Price on a

server that is linked to a large number of consumer clients. The size of a sorting issue

can be extremely large. For example, for their recommendation systems, social

networking sites such as Twitter or Weibo have to measure the most liked, commented

or forwarded posts. From a very wide community of popular users, billions if not trillions

of user-generated records. The velocity of the sorting measurement therefore plays a

key role in the performance of computer systems.

 With regard to this need, a large number of sorting algorithms have been

proposed by researchers and computer practitioners. Three algorithms are often used

by the quickest of them: quicksort, merge sort and heapsort. With regard to complexity,

in average situations, they all have a run-time O(n logg n). Quicksort and merge sort are

algorithms that are classic divide and conquer. Normally, their implementations rely on

recursion for simplicity. Since merge sort requires higher memory than quicksort in

average cases, quick-sort is more popular in computer programs.

In addition, heapsort requires a specialized heap of data structure. A heap is a

complete tree of binaries. A limitation of heapsort is that cache memory is not treated

well by it. When heapsort actually works on modern computer hardware, this issue

decreases the speed. Because of the effectiveness of memory usage and sorting

speed, heapsort is therefore not commonly used in practice, we choose quicksort as the

model checking algorithm. [LOU2018]