Question

1 11 AaBbCcDdee AaBbCcDdee AaBbCcDc Aaf Normal No Spacing Heading 1 WSU ID: Long Answer 1. Write a C++ program (along with helper functions) that takes an unordered array of integers (with at least one value) and swaps the smallest value with the first element of the array. If the smallest value appears several times, then the last occurrence (going left-to-right) will be the one moved to the front 30 points [Example) const int size = 5; int arr[size] = {11, 22, 22, 4, 42}; smallToFrent(art, size); Marr = {4, 22, 22, 11, 42) (Example) const int size = 15; int arr[size] = {90, 21, 72, 21, 42, 11, 22, 11, 10, 11, 90, 10, 14, 15, 55): smallToFrontar, size); llarr = {10, 21, 72, 21, 42, 11, 22, 11, 10, 11, 90, 90, 14, 15, 55

Answer 1

#include<iostream>
using namespace std;
void smallToFront(int arr[],int size)
{
   int small,index,tmp;
   small=arr[0];
   for(int i=0;i<size;i++)
   {
       if(small>=arr[i])
       {
           index=i;
           small=arr[i];
       }     
   }
   tmp=arr[0];
   arr[0]=small;
   arr[index]=tmp;
   for(int i=0;i<size;i++)
   {
       cout<<arr[i]<<" ";
   }
}
int main()
{
   const int size=5,size1=15;
   int arr[]={11,22,22,4,42};
   cout<<"Output for First array:\n";
   smallToFront(arr,size);
   cout<<"\n";
   int arr1[]={90,21,72,21,42,11,22,11,10,11,90,10,14,15,55};
   cout<<"Output for Second array:\n";
   smallToFront(arr1,size1);
   return 0;
}

OUTPUT:-

Output for First array:
4 22 22 11 42
Output for Second array:
10 21 72 21 42 11 22 11 10 11 90 90 14 15 55