-
Notifications
You must be signed in to change notification settings - Fork 0
Ordering Choices Example
Blind or Severe Low Vision Perspective (Shuttle Sort)
The Problem: Arrange the permutation, 5 2 4 1 3, into sorted order, 1 2 3 4 5.
| Permutation | Place 1 | Place 2 | Place 3 | Place 4 | Place 5 | Swop | Move |
|---|---|---|---|---|---|---|---|
| P00 | 5 * | 2 hear | 4 | 1 | 3 | (5,2) | R 1 |
| P01 | 2 | 5 * | 4* | 1 | 3 | (5,4) | R 1 |
| P02 | 2 | 4 | 5 * | 1 * | 3 | (5,1) | R 1 |
| P03 | 2 | 4 | 1 | 5 * | 3 * | (5,3) | |
| P03 | 2 | 4 | 1 | 3 * | 5 * | L 1 | |
| P03 | 2 | 4 | 1 * | 3 * | 5 | L 1 | |
| P03 | 2 | 4 * | 1 * | 3 | 5 | (1,4) | L 1 |
| P04 | 2 * | 1 * | 4 | 3 | 5 | (1,2) | |
| P05 | 1 * | 2 * | 4 | 3 | 5 | R 1 | |
| P05 | 1 | 2 * | 4 * | 3 | 5 | R 1 | |
| P05 | 1 | 2 | 4 * | 3 * | 5 | (4,3) | R 1 |
| P06 | 1 | 2 | 3 * | 4 * | 5 | R 1 | |
| P06 | 1 | 2 | 3 | 4 * | 5 * | L 1 | |
| P06 | 1 | 2 | 3 * | 4 * | 5 | L 1 | |
| P06 | 1 | 2 * | 3 * | 4 | 5 | L 1 | |
| P06 | 1 * | 2 * | 3 | 4 | 5 |
This tracks the moves and exchanges (swop of places) needed to move from the problem (the order interaction start arrangement) and the answer (the sorted arrangement). This sort requires 13 moves and 7 swops in all 20 actions.
In the example above the test taker has only two operations available: Move 1 box right or left, and swop the position of two adjacent boxes. This is optimistic for a screen reader user because one can only hear what is in one box at a time. So, with P00, the first line, you will begin hearing from Place 1 that contains a 5. Your move right will reveal the Place 2, containing the value 2. By remembering the value 5 in Place one you can swop it with 2. So not only are 20 operations needs but all swop actions require cognitive load.
Once again consider the permutation (5 2 4 1 3).
The sighted user sees the 5 and moves it to the end of list.
Next 1 is moved to the first position. We now have (1 2 4 3 5)
Move 3 ahead of 4 and we are done.
Three actions with now cognitive load cost.