added in some thoughts on how to solve the problems week 1

Week 1.md

@@ -3,13 +3,13 @@
 Problem: Given an array arr[] of n elements, write a function to search a given element x in arr[].
 
 ```
-Input : arr[] = {10, 20, 80, 30, 60, 50, 
+Input : arr[] = {10, 20, 80, 30, 60, 50,
                      110, 100, 130, 170}
           x = 110;
 Output : 6
 Element x is present at index 6
 
-Input : arr[] = {10, 20, 80, 30, 60, 50, 
+Input : arr[] = {10, 20, 80, 30, 60, 50,
                      110, 100, 130, 170}
            x = 175;
 Output : -1
@@ -17,6 +17,14 @@ Element x is not present in arr[].
 ```
 Hint: linear search
 
+
+*/ Trinh's Solution
+I can use a for loop to search each index (i) of the array, using a variable
+to store the previous (or first index) to compare to...
+using if == ?, if true, return the index (i), if false,
+continue searching.
+/*
+
 ### Problem 2
 Problem: Write a Java program to arrange the elements of an given array of integers where all negative integers appear before all the positive integers.
 
@@ -24,4 +32,22 @@ Input:
 `{ 2, 5, -55, 8, -72, -1, 53 }`
 
 Output:
-`{ -55, -72, -1, 2, 5, 8, 53 }`
+`{ -55, -72, -1, 2, 5, 8, 53 }`
+
+
+*/ Trinh's Solution
+Nested for loop to bubble sort?
+We can start at index 0, and start comparing,
+with each pass of the array, it will slowly move the elements
+until it becomes sorted.
+
+If we simply wanted the negative before the positive, we might not need
+a nested for loop? Since we aren't checking for < or >
+but rather just if it's positive or negative?
+
+
+
+
+
+
+/*