Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

/* Selection sort: We need a function that accepts an array of integers and its size and the starting index and returns the index of

/* Selection sort: We need a function that accepts an array of integers and its size and the starting index and returns the index of the smallest starting at that index. int findIndexSmallest(int A[], int size, int start); Once we have this function then we can use it in the sort function void selectionSort(int A[], int size) { //how many steps? size -1 steps. You think about a for loop that loops size -1 times loop{ // find the index of the smallest strating at i call it indexSmallest. Use the previous //function //swap element at index i with element at index indexSmallest } } int main() { //declare and array of 10 integers //have a loop to read the numbers from the user //display the array before sorting //call selectionSort function //display the array after sorting. } */

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Fundamentals Of Database Management Systems

Authors: Mark L. Gillenson

2nd Edition

0470624701, 978-0470624708

More Books

Students also viewed these Databases questions