Scribd
Upload
4 views2 pages

P 1

The document provides a C/C++ program that implements the Selection Sort algorithm to sort a set of integers. It generates random integers, sorts them, and measures the time taken for different sizes of input arrays greater than 5000. The program outputs the time taken for sorting each size, which can be used to plot a graph of time versus input size.

Uploaded by

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

P 1

The document provides a C/C++ program that implements the Selection Sort algorithm to sort a set of integers. It generates random integers, sorts them, and measures the time taken for different sizes of input arrays greater than 5000. The program outputs the time taken for sorting each size, which can be used to plot a graph of time versus input size.

Uploaded by

Pra Nav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Design and implement C/C++ Program to sort a given set of n integer elements using Selection Sort

method and compute its time complexity. Run the program for varied values of n> 5000 and record
the time taken to sort. Plot a graph of the time taken versus n. The elements can be read from a file
or can be generated using the random number generator.

#include <stdio.h>

#include <stdlib.h>

#include <time.h>

// Selection Sort function

void selectionSort(int arr[], int n)

int temp;

for (int i = 0; i < n - 2; i++)

int min_idx = i;

for (int j = i + 1; j < n-1; j++)

if (arr[j] < arr[min_idx])

min_idx = j;

// Swap the found minimum element with the first element

temp = arr[i];

arr[i] = arr[min_idx];

arr[min_idx] = temp;

// Function to generate an array of random integers

void generateRandomArray(int arr[], int n)

srand(time(NULL));

for (int i = 0; i < n; i++)


{

arr[i] = rand();

int main() {

int n_values[] = {5000, 10000, 15000, 20000}; // Array of n values

int num_values = sizeof(n_values) / sizeof(n_values[0]);

double time_taken[num_values];

for (int i = 0; i < num_values; i++)

int n = n_values[i];

int *arr = (int*)malloc(n * sizeof(int));

generateRandomArray(arr, n);

clock_t start = clock();

selectionSort(arr, n);

clock_t end = clock();

time_taken[i] = ((double)(end - start)) / CLOCKS_PER_SEC;

free(arr);

// Output time taken for sorting each value of n

printf("n\tTime Taken (s)\n");

for (int i = 0; i < num_values; i++)

printf("%d\t%f\n", n_values[i], time_taken[i]);

return 0;

You might also like