Scribd
Upload
8 views

Programing Project for Algorithm Analysis

Uploaded by

Windy Joseph
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Programing Project for Algorithm Analysis

Uploaded by

Windy Joseph
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Programing Project for algorithm analysis

Sorting, searching, and efficiency analysis

Class: Analysis of Algorithm

Windy Joseph

12/2/2024
Introduction:

In this project, I will apply the theory in the class to actual computer
simulation to verify my results. I will simulate the procedure of search, sorting by programming
and analyze the efficiency based on the computer simulation and
theoretical result.

This project simulates the procedures of searching and sorting in an array, followed by an
analysis of their computational efficiency. The simulation covers generating data, searching for
specific elements, counting occurrences, sorting the array, and comparing time efficiencies for
different operations. This project will generate 100,000 positive numbers between 0 and 125
and then it will search for the first occurrence of 53. Then the procedure will count how many
53’s are in the array and then the array will be sorted using Merge or Quick sort. Step 3 will be
repeated. Comparing time costs will show the time taken to perform the counting operation on
the unsorted array. The program then will be run 3 times displaying the results. I will discuss the
algorithms that are being used.

A sorting algorithm is a step-by-step computational procedure used to arrange the elements of a


list or array in a specific order, such as ascending or descending. Sorting algorithms are
fundamental in computer science and are used to organize data for efficient retrieval, analysis,
or manipulation.

A searching algorithm is a systematic method used to locate a specific element or a group of


elements within a data structure, such as an array, list, or database. Searching algorithms are
fundamental to computer science and are essential for data retrieval and manipulation.

Efficiency analysis of an algorithm refers to the evaluation of how effectively an algorithm utilizes
computational resources, such as time and memory, to solve a problem. The goal of efficiency
analysis is to predict the performance of an algorithm as the size of its input grows, enabling the
selection of the most suitable algorithm for a given task.

You might also like