Implementation Of Sorting Algorithms
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.
NOTE: Preview the following Table of Content before you download the full content. WYSIWYG – What You See Is What You Get.
Title Page
Certification
Dedication
Acknowledgement
Abstract
Table of Content
CHAPTER ONE
1.0 Introduction 1
1.1 Background of the Study 1-3
1.2 Statement of Problem 3-4
1.3 Objective/Purpose of the Study 4
1.4 Significance of the Study 4-5
1.5 Scope and Limitation of the Study 5
1.6 Organization of Work 6
CHAPTER TWO
Review of Related Literature to the Topic 7
2.0 A Reflective View on Sorting 7-8
2.1 Classification of Sorting 8
2.2 Internal Sorting Techniques 9
2.2.1 Bubble Sort 9-10
2.2.2 Heap Sort 11-12
2.2.3 Insertion Sort 13-14
2.2.4 Merge Sort 15-16
2.2.5 Quick Sort 16-18
2.2.6 Selection Sort 18-19
2.2.7 Shell Sort 19-20
2.2.8 Simple Sort 20-22
2.3 External Sorting Techniques 22
2.3.1 Method of External Sort 22-23
2.3.2 Disk Sort 24
2.3.3 Strategies for Choosing Sorting Method 24-25
CHAPTER THREE
3.0 System Analysis and Investigation 26
3.1 Analysis of Sorting Algorithms 26-27
3.2 Memory Space Allocation 27-29
3.3 Comparative Study of the Algorithm 30
3.4 Research Methodology 31-32
CHAPTER FOUR
4.0 Program Design and Implementation 33
4.1 Discussion of Findings 33
4.2 Design of Logic of Sorting Algorithms 34
4.3 Pseudo code of Logic Design 34-36
4.4 Program Flowchart
CHAPTER FIVE
5.0 Recommendation and Conclusion and 43
5.1 Problems Encountered during the
Research work 43
5.2 Conclusion 44
5.3 Recommendation 44-45
Reference 46-56
This “Implementation Of Sorting Algorithms” file contains 7 Chapters, 61 Pages and 8,596 Words.
The author of Implementation Of Sorting Algorithms is written at the front page of the downloaded file.
To download this Implementation Of Sorting Algorithms full file, click on “Download File” on top of this page and follow the next.