works for the selection sort. I need a function that would work using the same logic for the BubbleSort and InsertionSort.
I have this function that works for the selection sort. I need a function that would work using the same logic for the BubbleSort and InsertionSort.
void Selection_Sort(struct studentTag STUDENTS[], int nStudents)
{
struct studentTag s, t, temp;
int i, j;
for(i = 0; i < nStudents; i++)
{
for(j = i + 1; j < nStudents; j++)
{
s = STUDENTS[i];
t = STUDENTS[j];
if (strcmp(s.name.last, t.name.last) > 0)
{
temp = STUDENTS[j];
STUDENTS[j] = STUDENTS[i];
STUDENTS[i] = temp;
}
else if (strcmp(s.name.last, t.name.last) == 0)
{
if (strcmp(s.name.first, t.name.first) > 0)
{
temp = STUDENTS[j];
STUDENTS[j] = STUDENTS[i];
STUDENTS[i] = temp;
}
}
}
}
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
