Pseudocode Algorithm

[Toasted Onions]

For a computer science course I have this assignment:

Develop and write an algorithm to solve the problem given below.

Problem: You are given two pairs of numbers (month, year) representing two dates. Determine which date is the most recent. You may assume that both given dates are valid and are prior to today's date.

Note: Represent your algorithm using pseudo-code. This means to use simple English sentences to describe your algorithm accurately and explicitly. Assume that the person who reads your instructions does not understand the problem. Be certain to use only concepts that have been introduced in class: sequencing, choice and repetition. DO NOT code your algorithm in C++. Instead, use a word processor to enter your algorithm.

I'm having trouble, so if anybody could offer any hints, it would be great. Thanks!

[Toasted Onions]

Ok, I got it. Nevermind.

It won't let me delete the thread....