Write C++ program

Time Analysis

Task 1:

Modify random array generation problem, implement, and time execution of core functions.

Create an array that holds 1000 random integers between 1-1000.

Allow the user to enter an int for search.

Use the clock(); method to time the execution of the search and sort

Create and implement modified bubble sort algorithm which will sort the array before the Binary Search algorithm is executed.

Create and implement a Binary Search Algorithm

Execute the program 4 times running the modified bubble sort as the sorting algorithm

Measure the time it takes to execute the sort in milliseconds or even nanoseconds

• Describe your results

• Attach Photos of Source Code and Output

Task 2:

Modify random array generation problem, implement, and time execution of core functions.

Create an array that holds 1000 random integers between 1-1000.

Allow the user to enter an int to search.

Use the clock(); method to time the execution of the search and sort

Create and implement Insertion sort algorithm which will sort the array before the Binary Search algorithm is executed.

Create and implement a Binary Search Algorithm

Execute the program 4 times running the Insertion sort as the sorting algorithm

Measure the time it takes to execute the sort in milliseconds or even nanoseconds

• Describe your results

• Attach Photos of Source Code and Output

Task 3:

Modify random array generation problem, implement, and time execution of core functions.

Create an array that holds 1000 random integers between 1-1000.

Allow the user to enter an int to search.

Use the clock(); method to time the execution of the search and sort

Implement Linear Search

Execute the program 4 times running the Implement Linear Search

Measure the time it takes to execute the sort in milliseconds or even nanoseconds

• Describe your results

• Attach Photos of Source Code and Output

Time Analysis

Task 4:

Modify random array generation problem, implement, and time execution of core functions.

Create an array that holds 100000 random int between 1-1000.

Depending on your computer and compiler the above example may not work. Reduce the number of integers to 10,000 if your computer cannot handle the execution.

Allow the user to enter an int for search.

Use the clock(); method to time the execution of the search and sort

Create and implement modified bubble sort algorithm which will sort the array before the Binary Search algorithm is executed.

Create and implement a Binary Search Algorithm

Execute the program 4 times running the modified bubble sort as the sorting algorithm

Measure the time it takes to execute the sort in milliseconds or even nanoseconds

• Describe your results

• Attach Photos of Source Code and Output

Task 5:

Modify random array generation problem, implement, and time execution of core functions.

Create an array that holds 100000 random int between 1-1000.

Depending on your computer and compiler the above example may not work. Reduce the number of integers to 10,000 if your computer cannot handle the execution.

Allow the user to enter an int to search.

Use the clock(); method to time the execution of the search and sort

Create and implement Insertion sort algorithm which will sort the array before the Binary Search algorithm is executed.

Create and implement a Binary Search Algorithm

Execute the program 4 times running the Insertion sort as the sorting algorithm

Measure the time it takes to execute the sort in milliseconds or even nanoseconds

• Describe your results

• Attach Photos of Source Code and Output

Task 6:

Modify random array generation problem, implement, and time execution of core functions.

Create an array that holds 100000 random int between 1-1000.

Depending on your computer and compiler the above example may not work. Reduce the number of integers to 10,000 if your computer cannot handle the execution.

Allow the user to enter an int to search.

Use the clock(); method to time the execution of the search and sort

Implement Linear Search

Execute the program 4 times running the Linear Search.

Measure the time it takes to execute the sort in milliseconds or even nanoseconds

• Describe your results

• Attach Photos of Source Code and Output