Bubble sort and linear sort added.

Author: phyex0

.idea/vcs.xml

@@ -1,12 +1,13 @@
 package com.company.Algorithms;
+
 /*
-* Bubble Sort =
-*
-*
-*
-*
+* Bubble Sort:
+* Best case = O(n)
+* Average case = O(n^2)
+* Worst case = O(n^2)
 *
-* */
+* This algorithm sorts the array min to max. If current item is greater than the next it swaps.
+*/
 
 public class BubbleSort {
 

src/com/company/Algorithms/BubbleSort.java

@@ -0,0 +1,24 @@
+package com.company.Algorithms;
+
+/*
+* Linear Search Algorithm:
+* Best case = O(1)
+* Worst case = O(n)
+* Average case = O(n)
+*
+* If the given item is not in your list it returns -1 otherwise it returns the index that was first found.
+*/
+public class LinearSearch {
+
+ public static int linearSearch(int[] arr, int val){
+ int index=-1;
+ for(int i=0;i<arr.length;i++)
+ if(arr[i]==val){
+ index=i;
+ break;
+ }
+
+ return index;
+
+ }
+}

src/com/company/Algorithms/LinearSearch.java

@@ -1,5 +1,15 @@
 package com.company.DataStructures;
 
+/*
+* Linked List:
+*
+*
+*
+*
+*
+*
+* */
+
 public class LinkedList {
 
  class Node{

src/com/company/DataStructures/LinkedList.java

@@ -1,16 +1,16 @@
 package com.company;
 
 import com.company.Algorithms.BubbleSort;
+import com.company.Algorithms.LinearSearch;
 import com.company.DataStructures.LinkedList;
 
 public class Main {
 
  public static void main(String[] args) {
 // write your code here
  int[] arr = new int[]{3,2,1};
- BubbleSort.bubbleSort(arr);
- for(int i:arr)
- System.out.println(i);
+
+ System.out.println(LinearSearch.linearSearch(arr,5));