For the two algorithms, trace the list 4, 2, 5, 6, 1, 3. List out the iterations

Question

For the two algorithms, trace the list 4, 2, 5, 6, 1, 3. List out the iterations and the number of comparisons done.

0th iteration, 1st iteration etc.

procedure Sort A(a1, a2,..., an: a list of real numbers with n 1 1. for i 1 to n 1 item a 3. location i 4. for j i 1 to n if aj item then item :Sai location 8. location. E ai ai item procedure SortB(a1, a2,... an: a list of real numbers with n 21) for k 1 to n 2. i n -k+1 item 4. location :Si 5. for J 1 to i -1 if a, items then item. location alocation. 10 ai item.

Explanation / Answer

#include <iostream>
#include <stdlib.h>
#include<conio.h>
#include<math.h>
#include<vector>
using namespace std;

int min(int arr[], int maxIndex)

   come back min;
}
int indexOf(int range,int arr[], int maxIndex)

   }
   come back index;
}
int mean(vector<int> vc )

void show(vector<int> vc )

   int iter =1;
   do
          
   groups[indexOf(min(row,k),row,k)].push_back(objects[i]);
   }
  
   for(int j=0;j<k;j++)
  
   }
   if(!isEqual(oldCluster,cluster,k))
  
   iter++;  
   }while(!isEqual(oldCluster,cluster,k));
   cout<<"nn";
   for(int i=0;i<k;i++)
   teams = new ArrayList<>();
input = new Scanner(System.in);

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

for (int i = 0; i < noOfItems; i++) {
System.out.println("Enter worth for: " + (i + 1) + " item");
dataItems.add(input.nextInt());
if (i < k) total = 0;
for (Integer worth : list) add = total + value;
}
come back total / list.size();
}
}

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.