| Title | Finding Adjacent Numbers in Ascending Order in a Sequence of Numbers |
| Catalog Type | SLCItem |
| Persistent ID | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_j_check_adjacent__68bdb309f6cc3d7a9cc097e8?index=2 |
| Platform Name | PCEX |
| Features | — |
| Description | Construct a program that checks whether a sequence of non-zero numbers, entered one at a time, contains adjacent numbers in ascending order. Numbers are said to be in ascending order when they are arranged from the smallest to the largest number. For example, 5, 9, 13, 17 and 21 are arranged in ascending order.\nNote that you need to think what value should the program use to indicate the end of the input. |
| Keywords | — |
| Author | Mohammad Hassany |
| Institution | University of Pittsburgh |
| Iframe URL | https://acos.cs.vt.edu/html/acos-pcex/acos-pcex-examples/while_loops_j_check_adjacent__68bdb309f6cc3d7a9cc097e8?index=2 |
| Protocol | SPLICE |
| Protocol URL | |
| License | MIT |
| Programming Language | JAVA |
| Natural Language | en |