Implementation Of Sorting Algorithms

Computer Science Project Material with Source Code Included

Computer Science Project Material with Source Code Included


This research work took theoretical and empirical studies that have been done over the past years on sorting algorithms and its variants. The study includes a comparative sorting algorithms (i.e. Bubble sort, shell sort, straight insertion sort quick sort, simple sort etc.) the same criteria such as coding memory space used meaning efficiency as in the time used by the computer argument on the number of comparison. Data flow diagrams and process to evaluate the performance of these sorting techniques. The programming language used to implement these sorting algorithms is BASIC.

The various chapter in this research work is logically arranged to reflect in each stage in the research process, the adopting chapters ranges from introduction literature review, systems investigation/analysis, system programming/ implementation to the researchers, recommendations and conclusion. The coded program and its output are also attached.

Table of Content

  • Title Page
  • Certification
  • Dedication
  • Acknowledgement
  • Abstract
  • Table Of Content

Chapter One

1.0 Introduction

  • 1.1 Background of the Study
  • 1.2 Statement of Problem
  • 1.3 Objective / Purpose of the Study
  • 1.4 Significance of the Study
  • 1.5 Scope and Limitation of the Study
  • 1.6 Organization of Work

Chapter Two

2.0 Review of Related Literature to the Topic

  • 2.0 A Reflective View on Sorting
  • 2.1 Classification of Sorting
  • 2.2 Internal Sorting Techniques
  • 2.2.1 Bubble Sort
  • 2.2.2 Heap Sort
  • 2.2.3 Insertion Sort
  • 2.2.4 Merge Sort
  • 2.2.5 Quick Sort
  • 2.2.6 Selection Sort
  • 2.2.7 Shell Sort
  • 2.2.8 Simple Sort
  • 2.3 External Sorting Techniques
  • 2.3.1 Method of External Sort
  • 2.3.2 Disk Sort
  • 2.3.3 Strategies for Choosing Sorting Method

Chapter Three

3.0 System Analysis and Investigation

  • 3.1 Analysis of Sorting Algorithms
  • 3.2 Memory Space Allocation
  • 3.3 Comparative Study of the Algorithm
  • 3.4 Research Methodology

Chapter Four

4.0 Program Design and Implementation

  • 4.1 Discussion of Findings
  • 4.2 Design of Logic of Sorting Algorithms
  • 4.3 Pseudo Code of Logic Design
  • 4.4 Program Flowchart

Chapter Five

5.0 Recommendation and Conclusion

  • 5.1 Problems Encountered During the Research Work
  • 5.2 Conclusion
  • 5.3 Recommendation
  • Reference

Chapter One

1.0 Introduction

1.1 Background of Study

The Need of Information in General

Mangers need information to perform their function and not data. Information is to data what is finished product is to raw materials used in producing it. Information is the manger in his decision-making activity.

Information is to business system what blood circulatory system is to human body. When information fails to reach any part of the organization system, due to structural deficiency, that part become anemia and soon becomes a liability to the rest of the supper system. This is why the system theory states that every system is held together by information exchange.

For information to retain its quality resources it must have the following qualities: Brief/Detail, Accurate, Rare/Scare, Timeliness/Appropriateness, Frequency/Understanding and Transferable.

Computers are virtually used in all areas of life. It is difficult to see any aspect of the society that has not been affected by some form of computerization. Computer is used in preparing company patrol, record customers sales on items bought from a shop switching of telephone class when lines are overload, give detail of dentists, patients, analyze blood samples, control application in homes etc.

Therefore, computers can be in all sectors in the society such as business, health, and industry education, national development. Before the advent of computer manual method was used in data processing and calculators and the human brain were the only thing used.

This manual method is time wasting and mistake oriented. At present the use of computer in data processing has gone a long way in increasing the credibility of the system. The computer is able to process data quickly; making available information on stock levels slow moving items or trend in demand.

A business establishment equally apply computer in the preparation of payroll. When computer is used for this purpose, it helps to ensure efficiency and accuracy in calculation. In science research like medical, it is used for analysis data produced from experiment for instance in the trial of drugs. It is also a diagnostic tool in hospital, clinic and keeping patient.

In every organization especially an open system or social organization, information is very essential. Since what organization needed is information and not data, there is urgency that proper information should be diffused or be circulated within the organization.

Having defined information as the processed data that is meant to be used by the approved user. It is of paramount demand that no decision be taken in an organization without proper consultation of the computer data processing centre. Therefore, any organization that takes decision without computer analysis is prone to error.

In some real life application of computer, example in sorting information in a given order, often known as automation. Information is sorted in alphabetical order, numerical order either ascending or descending. The use of computer in sorting has eliminated the manually performed method, which is prone to error, mistake and time wasting hence the need for its automation. This is aimed at the automation of this manual method hence eliminating and minimizing the error encountered.

1.2 Statement of Problem

The method of organization of data in the computer is the main focus of this work. Also the, mismanagement of computer memory and time is another problem to look into for solution. It could be recalled that the necessary and efficiency of sorting activities cannot be over emphasized.

However, this project research is aimed at taking a comprehensive look on some sorting algorithms in BASIC programming languages to access their performance. The above mentioned high-level programming language are used or considered for the implementation of the sorting concept.

1.3 Objective / Purpose of the Study

This deals with the presentation of information or data in an appreciable from and also to minimize the time used in searching for items. However, it can be seen that a well-sorted or organized file enhances easy searching of data while unsorted one will pose little or great problem to locate a given item in a large list. However, the comparison process will be based on the following:

  1. Memory space used
  2. Number of comparison made during sorting process
  3. Coding based on the sorting algorithm
  4. Computer.

1.4 Significance of the Study

Sorting algorithm was designed to enable the people and the society to be acquainted with arrangement of data and item. Above topic of discussion will make the society to determine and know their stand in the arrangement and organization of data in the memory location and also make proper use and utilization of the computer time.

1.5 Scopes and Limitation of the Study

As was stated earlier, it is quite understood that there are lots of sorting technique. This project research will be focusing on the implication of some algorithms. It will also be critically base on the following.

  1. The use of linear list (array) as the data structure.
  2. Insertion sort, bubble sort, selection sort etc.
  3. The use of BASIC as the programming language for coding implementation.

This research work was limited by some ups and downs, which was encountered at the process of carrying out the research. Some of the problems that limited the finding of research work are as follow:

  1. Lack of resourceful library for material that would aid further investigations and finding.
  2. Limited time to carryout more research as the research work is coupled with the other academic statues.
  3. Financial instability, which constituted more to the limitation as related to the movement from one place to another for materials for further aids towards the topic of discussion.

1.6 Organization of Work

This is a project work that is written to analyze the implementation of sorting algorithm. This project is divided into five chapters. Chapter one is the introduction; chapter two is the literature review of the project topic under discussion. Chapter three is the research methodology; chapter four is the analysis of the technical procedures and various methods of data presentation/programs while chapter five is the summary conclusion and recommendation.

Chapter Five

Recommendation and Conclusion

5.1 Problems Encountered During the Research Work

The actual survival of any research work or project can be affected by time finance and other environmental factors. Problems encountered in the process of this work have been classified into technical and non technical problems.

The major problem encountered during this research work is the problem of inadequate material to provide enough information about the sorting algorithm and their detailed analysis also, the cost of procuring a computer system to with all the languages for implementation, so as to develop more flexible and efficient programs. Also, the non technical problem encountered is the problem of find and time to source for information and acquiring relevant textbook to provide necessary literature. All these factors contributed to the set back of this research work

5.2 Conclusion

Observation and analysis so far has clearly shown that the importance of sorting and its study cannot be over emphasized. Data needed to be organized in a specific order to promote orderliness and easy access.

This is complexity and execution processes determine the efficiency of sorting techniques.

Each sorting techniques has its advantage and disadvantage to some extent, so the choice of a sorting technique depends on the order of the data the data structure involved and the programmers ability.

However, the implementation of sorting techniques in a programming language should be dependent on how that sorting techniques effectively utilizes the memory and time in such language.

5.3 Recommendation

Based on the discoveries made during this research work, it has been deduced that insertion sort techniques or method is the most efficient technique among the four techniques tested. This was as a result of its immersion and swapping of data to inter change each data to its definite place and destination as position in the memory. Therefore, insertion sort has been recommended for use in sorting processes and activities.

Project Material Download

3,000 Naira

The Complete Material Will Be Sent to You in Just 2 Steps

Quick & Simple…

Step One Purchase

Make Payment (Through Transfer) of ₦3,000 to Any of the Account Below

Access Bank PlcAcc No: 0811003731
Samphina Academy
Current Account
Zenith BankAcc No: 1225513212
Samphina Academy
Current Account
PalmPay Main LogoAcc No: 8143831497
Samphina Academy
Digital Account

Or CLICK HERE To Pay With Debit Card

CLICK HERE To Purchase Material ($15)
Make Payment of 80 GHS to 0553978005 | Douglas Osabutey | MTN MoMo

Step Two Purchase

Send the Following Details on WhatsApp ( 08143831497) After Payment

  1. Payment Details

  2. TOPIC: Implementation Of Sorting Algorithms

The Complete Material Will Be Sent To You On WhatsApp After Receiving Your Details
T & C Apply

  Contact Our Help Desk

Need a Different Topic? Perform a Quick Search

Samphina Academy

Samphina Academy is an Online Educational Resource Center that is aimed at providing students with quality information and materials to aid them in succeeding in their academic pursuit.