Slove the problem in the link,i am trying for 2 days but failed.

Question

https://8dfd4c4f-a-686c9e04-s-sites.googlegroups.com/a/northsouth.edu/cse225/Lab-QueueLinkedLIst.pdf?attachauth=ANoY7covEpsMj_JS2ydx_wiA9GNTH06VzS0RYm1PpDd174y4zxM7bgg6ivLee8f0UA4LIzNNjBcqcqxdUDbpFjcENW4yfs1NTgjHSjCEWzp5884vbCXLVi8rEa8menIhD5TGFC_43SdUKn484HEAxzMOhdQnYsCw6hWwbzv9XQT-lfc_mnNvgCC76RXjYcj58q5uJI-8PwtHGdVWKNVG0UOiecOUSFpxXg%3D%3D&attredirects=0

Answer 1

// m is size of coins array (number of different coins)

int minCoins(int coins[], int m, int V)

{

// base case

if (V == 0) return 0;

// Initialize result

int res = INT_MAX;

// Try every coin that has smaller value than V

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

{

if (coins[i] <= V)

{

int sub_res = minCoins(coins, m, V-coins[i]);

// Check for INT_MAX to avoid overflow and see if

// result can minimized

if (sub_res != INT_MAX && sub_res + 1 < res)

res = sub_res + 1;

}

}

return res;

}

// Driver program to test above function

int main()

{

QueType<int> q;

if (q.IsEmpty()) { cout<< "Queue is Empty"<<endl; } else { cout << "Queue is not empty"<<endl; }

if (q.IsFull()) { cout<< "Queue is Full"<<endl; } else { cout << "Queue is not full"<<endl; }

int iNums[]={5,7,4,2};

for (int iLoop=0; iLoop<4; iLoop++)

{

cout << "pushing " << iNums[iLoop] << endl;

q.Enqueue(iNums[iLoop]);

}

if (q.IsEmpty()) { cout<< "Queue is Empty"<<endl; } else { cout << "Queue is not empty"<<endl; }

if (q.IsFull()) { cout<< "Queue is Full"<<endl; } else { cout << "Queue is not full"<<endl; }

for (int iLoop=0; iLoop<4; iLoop++)

{

int iCurIntNum;

q.Dequeue(iCurIntNum);

cout << " popped "<<iCurIntNum << endl;

}

int numCoins=-1;

while (numCoins<1)

{

cout << "Please input # of coins :>";

cin>>numCoins;

}

int* coins = new int[numCoins];

for (int iLoop=0; iLoop<numCoins; iLoop++)

{

cout << "Please input coin value :>";

cin >> coins[iLoop];

}

int V = -1;

while (V<1)

{

cout <<"Please input the final amount :>";

cin >>V;

}

cout << "Minimum coins required is "

<< minCoins(coins, numCoins, V);

return 0;

}