logo Practice-It logo

Main Page → Problems → Solve a Problem

isPairwiseSorted

Related Links:
Author: Stuart Reges (on 2014/02/13)

Write a method isPairwiseSorted that returns whether or not a list of integers is pairwise sorted (true if it is, false otherwise). A list is considered pairwise sorted if each successive pair of numbers is in sorted (non-decreasing) order. For example, if a variable called list stores the following sequence of values: 

        [3, 8, 2, 5, 19, 24, -3, 0, 4, 4, 8, 205, 42]

then the following call: 

        list.isPairwiseSorted()

should return the value true because the successive pairs of this list are all sorted: (3, 8), (2, 5), (19, 24), (-3, 0), (4, 4), (8, 205). Notice that the extra value 42 at the end had no effect on the result because it is not part of a pair.

If the list had instead stored the following values: 

        [1, 9, 3, 17, 4, 28, -5, -3, 0, 42, 308, 409, 19, 17, 2, 4]

then the method should return the value false because the pair [19, 17] is not in sorted order. If a list is so short that it has no pairs, then it is considered to be pairwise sorted.

You are writing a method for the IntList class discussed in lecture (handouts 3 and 5): 

        public class IntList {
                private int[] elementData; // list of integers
                private int size;          // current # of elements in the list

                <methods>
        }

You are not to call any other IntList methods to solve this problem.

Write your solution to isPairwiseSorted below.

Type your solution here:


This is a partial class problem. Submit code that will become part of an existing Java class as described. You do not need to write the complete class, just the portion described in the problem.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.