gs gs122 Searching - Linear Search Iterative - Quiz No.1

 int unorderedLinearSearch(int arr[], int size, int data) { int index; for(int i = 0; i < size; i++) { if(arr[i] == data) { break; } } return index; }

 int unorderedLinearSearch(int arr[], int size, int data) { int index; for(int i = 0; i <= size; i++) { if(arr[i] == data) { index = i; break; } } return index; }

 int unorderedLinearSearch(int arr[], int size, int data) { int index; for(int i = 0; i < size-1; i++) { if(arr[i] == data) { index = i; break; } } return index; }

 public int linearSearch(int arr[],int key,int size) { int index = -1; int i = 0; while(size > 0) { if(data[i] == key) { index = i; } if(data[i] > key)) { index = i; break; } i++; } return index; }

 public int linearSearch(int arr[],int key,int size) { int index = -1; int i = 0; while(size > 0) { if(data[i] == key) { break; } if(data[i] > key)) { index = i; } i++; } return index; }

 public int linearSearch(int arr[],int key,int size) { int index = -1; int i = 0; while(size > 0) { if(data[i] == key) { break; } if(data[i] > key)) { break; index=i; } i++; } return index; }

 public void linSearch(int[] arr, int first, int last, int key) { if(first == last) { System.out.print("-1"); } else { if(arr[first] == key) { System.out.print(first); } else { linSearch(arr, first+1, last-1, key); } } }

 public void linSearch(int[] arr, int first, int last, int key) { if(first == last) { System.out.print("-1"); } else { if(arr[first] == key) { System.out.print(last); } else { linSearch(arr, first+1, last, key); } } }

 public void linSearch(int[] arr, int first, int last, int key) { if(first == last) { System.out.print("-1"); } else { if(arr[first] == key) { System.out.print(first); } else { linSearch(arr, first+1, last+1, key); } } }

 public int findPopular(int[] a) { if (a == null || a.length == 0) return 0; Arrays.sort(a); int previous = a[0]; int popular = a[0]; int count = 1; int maxCount = 1; for (int i = 1; i < a.length; i++) { if (a[i] == previous) count++; else { if (count > maxCount) { popular = a[i]; maxCount = count; } previous = a[i]; count = 1; } } return count > maxCount ? a[a.length-1] : popular; }

 public int findPopular(int[] a) { if (a == null || a.length == 0) return 0; Arrays.sort(a); int previous = a[0]; int popular = a[0]; int count = 1; int maxCount = 1; for (int i = 1; i < a.length; i++) { if (a[i+1] == previous) count++; else { if (count > maxCount) { popular = a[i-1]; maxCount = count; } previous = a[i]; count = 1; } } return count > maxCount ? a[a.length-1] : popular; }

 public int findPopular(int[] a) { if (a == null || a.length == 0) return 0; Arrays.sort(a); int previous = a[0]; int popular = a[0]; int count = 1; int maxCount = 1; for (int i = 1; i < a.length; i++) { if (a[i+2] == previous) count++; else { if (count > maxCount) { popular = a[i-1]; maxCount = count; } previous = a[i]; count = 1; } } return count > maxCount ? a[a.length-1] : popular; }