Boaty ⛵ 🚤 ⛵ -- Daniel Gelfand, Tim Marder, Maxwell Vale

http://www.java2novice.com/data-structures-in-java/queue/double-ended-queue/

💦 Step 1 💦

Create Deque interface. ✅

💦 Step 2 💦

Write the methods specified by the Deque interface in QQKachoo.

• offerFirst(e):white_check_mark:
• offerLast(e):white_check_mark:
• pollFirst():white_check_mark:
• pollLast():white_check_mark:
• peekFirst():white_check_mark:
• peekLast():white_check_mark:

Methods will be written one at a time using the interface as a guide and compilability will be ensured.

💦 Step 3 💦

Test. Test. Test. Profit. 💰 ✅

Why an ArrayList based architecture?

ArrayList methods closely resemble the necessary methods needs for a deque. The handy ArrayList methods, in addition to automatic resizing, make ArrayList a decent option for a deque. Although an O(n) runtime will be encountered during element shifts, the ease of use in contrast with the pointers of LLNodes and the size issues of arrays make it the best option for Boaty.

Development Plan

1. Select methods for Deque considering the features that make a deque.:white_check_mark:
   • Insertion and Removal from front and back is required.
2. Write Deque interface.:white_check_mark:
3. Write Deque methods in QQKachoo with plenty of comments. ArrayList methods will be used for this lab.:white_check_mark:
   • offerFirst(e) and offerLast(e) will be written using the add methods of ArrayList.
   • pollFirst() and pollLast() with the remove() method of ArrayList.
   • peekFirst() and peekLast() with the get() method of ArrayList.
   • isEmpty() with the size() method of ArrayList.
4. Test all the methods using a driver file.:white_check_mark:
5. Update README.md with anything notable.:white_check_mark: