Sorting Design and AnalysisFor this assignment, you need to study the performance of 2 designed algorithms using different logic.You need to write a program in C language that takes N (size of input) then write the following functions/methods:int[] GenerateValues (N) where N is random int values between 0 and N-1.DistinctValues Algorithms:int findDistintValuesWithoutSort( A, N) to count the number of distinct values in A without sorting algorithm.int findDistintValuesWithSort( A, N) to count the number of distinct values using any sorting algorithm (i.e., quicksort or merge sort or heapsort).Print the execution time for each method to find the distinct values where N = 103, 104, and 105.Note the execution time in a table and discuss your results in the document file. Discuss the execution time compared to your big -O analysis of the 2 DistinctValues algorithms.

Answered: Sorting Design and Analysis For this…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Sorting Design and Analysis

For this assignment, you need to study the performance of 2 designed algorithms using different logic.

You need to write a program in C language that takes N (size of input) then write the following functions/methods:

int[] GenerateValues (N) where N is random int values between 0 and N-1.
DistinctValues Algorithms:
- int findDistintValuesWithoutSort( A, N) to count the number of distinct values in A without sorting algorithm.
- int findDistintValuesWithSort( A, N) to count the number of distinct values using any sorting algorithm (i.e., quicksort or merge sort or heapsort).
Print the execution time for each method to find the distinct values where N = 10³, 10⁴, and 10⁵.
Note the execution time in a table and discuss your results in the document file. Discuss the execution time compared to your big -O analysis of the 2 DistinctValues algorithms.

Expert Solution

Step by step

Solved in 3 steps with 7 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions