Scribd
Upload
4 views3 pages

Final Project

The document outlines a research project evaluating the performance of the Bubble Sorting Algorithm, focusing on its efficiency and accuracy. It includes sections on the introduction to sorting algorithms, methodology, results presentation, discussion, conclusion, and recommendations. The study aims to analyze theoretical time complexity, actual execution time, and the stability of the algorithm through empirical testing.

Uploaded by

reivensantiago8
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views3 pages

Final Project

The document outlines a research project evaluating the performance of the Bubble Sorting Algorithm, focusing on its efficiency and accuracy. It includes sections on the introduction to sorting algorithms, methodology, results presentation, discussion, conclusion, and recommendations. The study aims to analyze theoretical time complexity, actual execution time, and the stability of the algorithm through empirical testing.

Uploaded by

reivensantiago8
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

IMRAD Research Template for Sorting Algorithms

Title Page

A Performance Evaluation of the Bubble Sorting Algorithm in Terms of Efficiency and Accuracy

Author:

Santiago, Reiven Josh T.

Sanvictores, Jon Irvin M.

Barrios, Bryan Jhay A.

Malagasi, Rayniel M.

Course / Section:

BSCS 2-A

Instructor:

Villones, Ramon

Date Submitted:

(TBA)
Table of Contents

1.​ Introduction
a.​ Background of the Study (Jon)
i.​ Introduce what sorting algorithms are.
ii.​ Explain the importance of sorting in computer science and real-world
applications.
iii.​ Describe why analyzing one sorting algorithm is relevant.
b.​ Statement of the Problem
i.​ What is the theoretical time complexity?
ii.​ What is the observed execution time?
iii.​ Is the ______ Sorting Algorithm stable or unstable?
c.​ Objectives of the Study
i.​ To describe the theoretical time complexity
ii.​ To determine the algorithm's actual execution time
iii.​ To identify whether the chosen algorithm is stable or unstable
2.​ Methodology
a.​ Research Design
i.​ State that this is an algorithm performance evaluation research.
b.​ Materials and Tools
i.​ Programming language (Java)
ii.​ IDE (NetBeans, VSCode, etc.)
iii.​ Laptop/computer specifications
iv.​ Timer functions / [Link]()
c.​ Algorithm Description ()
i.​ Provide the definition of the chosen algorithm.
ii.​ Include a flowchart or step-by-step pseudocode.
d.​ Implementation Procedure
i.​ Create dataset inputs (e.g., 100, 500, 1000 elements).
ii.​ Generate random numbers for each dataset.
iii.​ Implement the chosen sorting algorithm in code.
iv.​ Measure execution time for each dataset size.
v.​ Record and store results in a table.
3.​ Results
a.​ Presentation of Results
i.​ Use tables and charts to present performance data.

Input Size Trial 1 Trial 2 Trial 3 Average Time (ms)


100
500
1000
b.​ Interpretation of Results
i.​ Does the algorithm get slower as input size increases?
ii.​ Does it match the expected time complexity?
iii.​ Any anomalies or interesting observations?
4.​ Discussion
a.​ Comparison with Theory
i.​ Does the algorithm perform better/worse than expected?
b.​ Strengths and Limitations
i.​ Where the algorithm works well
ii.​ Where it performs poorly
iii.​ Conditions that affect efficiency
5.​ Conclusion and Recommendations
a.​ Conclusion
i.​ Summarize the major findings:
1.​ Overall performance
2.​ Accuracy of sorting
3.​ Time behavior across datasets
4.​ Relevance to complexity theory
b.​ Recommendations
i.​ Suggest improvements
6.​ References
a.​ Use APA 7th format.
7.​ Appendices
a.​ Attach:
i.​ Full source code
ii.​ Screen/Video recording of the experimentation process
b.​ Curriculum Vitae of the Authors

Introduction to sorting algorithm’s

You might also like