Question

Please write a c++ code

If your nameArray variable is sorted using Bubble Sort Algorithm, it will go through a several pass-throughs and characters will be swapped in each pass-through, until nameArray gets completely sorted (alphabetically, in descending order). Show all these stages (Passes and swaps within Passes) for your nameArray. Here is an example, with the name JONPDOE, of how I want you to write these steps:

Pass-1:

[J O] N P D O E ==> [O J] N P D O E Note: O and J were swapped

O [J N] P D O E ==> O [N J] P D O E Note: N and J were swapped

O N [J P] D O E ==> O N [P J] D O E Note: P and J were swapped

O N P [J D] O E ==> O N P [J D] O E Note: No Swaps

O N P J [D O] E ==> O N P J [O D] E Note: O and D were swapped

O N P J O [D E] ==> O N P J O [E D] Note: E and D were swapped

Pass-2:

[O N] P J O E D ==> [O N] P J O E D Note: No Swap

O [N P] J O E D ==> O [P N] J O E D Note: P and N were swapped

O P N [J O] E D ==> O P N [O J] E D Note: O and J were swapped

(so on, until the array is completely sorted)

a) How many passes were required? (2 passes shown above; but more required in our example)

b) How many swaps within each pass? (in our example: Pass1: 5 swaps, Pass2: 2…)

c) How many total swaps were performed? (in our incomplete example: 7 swaps so far…)

Answer 1

#include<iostream>
using namespace std;
int count=0;
void swap(char arr[],int i, int j)
{
char temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
count++;
}
void bubbleSort(char arr[],int n)
{
// One by one move boundary of unsorted subarray
for (int i = 1; i < n; i++)
{
cout<<"\nString is in pass "<<i<<endl;
for (int j = 0; j < n-i; j++)
if (arr[j] < arr[j+1])
{
cout<<endl<<arr<<"=>";
swap(arr,j, j+1);
cout<<arr<<":\t"<<arr[j+1]<<" and "<<arr[j]<<"are swaped";
}
else
{
cout<<endl<<arr<<"=>";
cout<<arr<<":\t There is no swap";
}
  
  

}
}
void selectionSort(char arr[],int n)
{
  

// One by one move boundary of unsorted subarray
for (int i = 0; i < n-1; i++)
{
// Find the minimum element in unsorted array
int min_idx = i;
for (int j = i+1; j < n; j++)
if (arr[j] > arr[min_idx])
min_idx = j;
if(min_idx != i)
{
swap(arr,min_idx , i);
cout<<endl<<arr<<"=>";
cout<<arr<<":\t"<<arr[min_idx]<<" and "<<arr[i]<<"are swaped";
}
else
{
cout<<endl<<arr<<"=>";
cout<<arr<<":\t There is no swap";
}
  

}
}
int main()
{
char str[30],str1[30];
int len=0;
cout<<"\n Enter the string:";
cin>>str;
while(str[len]!=0)
{
str1[len]=str[len];
len++;
}
str1[len]='\0';
bubbleSort(str,len);
cout<<" \n Number of Swap in bubble sort:"<<count;
count=0;
cout<<"\nSelection Sort Output:\n";
selectionSort(str1,len);
cout<<" \n Number of Swap in Selection sort:"<<count;
}

chandan e Computer Science quest (M Someone commented c/X GIArm Getting This Error w .wvector begin-C-Refe L × × Cwww.HomeworkLib.com/homework-help/expertquestion Ξ Chegg Study Search TEXTBOOK SOLUTIONS EXPERT O&A Algorithm is used How many iterations were required? CAUsers CS Nishtha\DesktoplHomeworkLib-bubblestring.exe Skip & Get next question PNOJED OPNOJED: tring is in pass 3 There is no swap 0 and Pare svaped There is no swap N and 0are svaped There is no swap PONOJEDPONOJED ED-P0ONJED: ED-P0ONJED: tring is in paas Your answer POONJED: ED-P0ONJED: There is no swap There is no swap There is no swap tring is in paas bubbleSort(str,len) coutn Number of Swap in bubble sort"<count, count 0 coutes inSelection Sort Outputin" selectionsort (str1,len) cout<<-in Number of swap in selection sort"<<count; POONJED There is no swap There is no swap tring is in paas POONJED There 18 n0 ap Nunber of Swap in bubble sort:9 election Sort Output: DOE-PONJDOE: JDNE POOJDNE: J and Pare swaped There is no swap N and Oare swaped 5/1/2018