diff --git a/a1/src/edu/wmich/cs3310/a1/Main.java b/a1/src/edu/wmich/cs3310/a1/Main.java
index 19e57dd999ab94b6a24be52b0c4fa397abdca284..dc261bd082b5f61b510403aa2ea56a96b07e9212 100644
--- a/a1/src/edu/wmich/cs3310/a1/Main.java
+++ b/a1/src/edu/wmich/cs3310/a1/Main.java
@@ -1,3 +1,29 @@
+/**
+ * Brandon Rodriguez
+ * CS3310 Assignment 2
+ * 10-13-17
+ */
+
+/**
+ * Assignment Goal:
+ * To get used to linked lists and analyze time complexity differences between them.
+ *
+ *
+ * "I give permission tot he instructor to share my solution(s) with the class."
+ */
+
+/**
+ * Notes:
+ *  Due to habit, I immediately made a doubly-linked list without thinking.
+ *  It's just my standard go-to with linked lists by now.
+ *  However, this assignment seems to assume a singly-linked list will be used.
+ *
+ *  To compensate, I made a method to simulate singly-linked handling,
+ *  and included time complexity for both that and standard doubly-linked implementation.
+ */
+
+
+
 package edu.wmich.cs3310.a1;
 
 import java.io.IOException;