The Nerd Guy

Bubble Sort  is a simple algorithm which is used to sort a given set of n elements provided in form of an array with n  number of elements. Bubble Sort compares all the element one by one and sorts them based on their values. If the given array has to be sorted in ascending order, then bubble sort will start by comparing the first element of the array with the second element, if the first element is greater than the second element, it will  swap  both the elements, and then move on to compare the second and the third element, and so on. If we have total  n  elements, then we need to repeat this process for  n-1  times. It is known as  bubble sort , because with every complete iteration the largest element in the given array, bubbles up towards the last place or the highest index, just like a water bubble rises up to the water surface. Sorting takes place by stepping through all the elements one-by-one and comparing it with the adja...

Objective Today's challenge puts your understanding of nested conditional statements to the test. Task Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows: If the book is returned on or before the expected return date, no fine will be charged (i.e.:  . If the book is returned after the expected return  day  but still within the same calendar month and year as the expected return date,  . If the book is returned after the expected return  month  but still within the same calendar year as the expected return date, the  . If the book is returned after the calendar  year  in which it was expected, there is a fixed fine of  . Input Format The first line contains   space-separated integers denoting the respective  ,  , and   on which the book was  actually...