From 2cc325e243af938bb7630a6e36f0aea6dcc6a003 Mon Sep 17 00:00:00 2001 From: tandrimasingha <78292851+tandrimasingha@users.noreply.github.com> Date: Sat, 2 Oct 2021 17:41:53 +0530 Subject: [PATCH 1/4] Create Frequency of number in array.java --- .../Frequency of number in array.java | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Java_Program/Frequency of number in array.java diff --git a/Java_Program/Frequency of number in array.java b/Java_Program/Frequency of number in array.java new file mode 100644 index 0000000000..9d7a392b0f --- /dev/null +++ b/Java_Program/Frequency of number in array.java @@ -0,0 +1,26 @@ +public class Frequency { + public static void main(String[] args) { + int [] arr = new int [] {9, 2, 5, 3, 5, 2, 9, 5, 0}; + + int [] f = new int [arr.length]; + int m = -1; + for(int i = 0; i < arr.length; i++){ + int count = 1; + for(int j = i+1; j < arr.length; j++){ + if(arr[i] == arr[j]){ + count++; + + fr[j] = m; + } + } + if(f[i] != m) + f[i] = count; + } + System.out.println(" Element | Frequency"); + + for(int i = 0; i < f.length; i++){ + if(f[i] != m) + System.out.println(" " + arr[i] + " | " + fr[i]); + } + + }} From abd1e8d99593ff75d3684586eeecc4cf38fa4814 Mon Sep 17 00:00:00 2001 From: tandrimasingha <78292851+tandrimasingha@users.noreply.github.com> Date: Sat, 2 Oct 2021 17:43:50 +0530 Subject: [PATCH 2/4] Create binary_search.java --- Java_Program/binary_search.java | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 Java_Program/binary_search.java diff --git a/Java_Program/binary_search.java b/Java_Program/binary_search.java new file mode 100644 index 0000000000..1fadd2c114 --- /dev/null +++ b/Java_Program/binary_search.java @@ -0,0 +1,25 @@ +class BinarySearchExample{ + public static void binarySearch(int arr[], int first, int last, int key){ + int mid = (first + last)/2; + while( first <= last ){ + if ( arr[mid] < key ){ + first = mid + 1; + }else if ( arr[mid] == key ){ + System.out.println("Element is found at index: " + mid); + break; + }else{ + last = mid - 1; + } + mid = (first + last)/2; + } + if ( first > last ){ + System.out.println("Element is not found!"); + } + } + public static void main(String args[]){ + int arr[] = {1,2,3,4,5}; + int key = 5; + int last=arr.length-1; + binarySearch(arr,0,last,key); + } +} From 85149cfbe37cfa2c05dcb153e4f99836b644cf01 Mon Sep 17 00:00:00 2001 From: tandrimasingha <78292851+tandrimasingha@users.noreply.github.com> Date: Sat, 2 Oct 2021 17:47:18 +0530 Subject: [PATCH 3/4] Create Bubble_sort.java --- Java_Program/Bubble_sort.java | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 Java_Program/Bubble_sort.java diff --git a/Java_Program/Bubble_sort.java b/Java_Program/Bubble_sort.java new file mode 100644 index 0000000000..d71b23807d --- /dev/null +++ b/Java_Program/Bubble_sort.java @@ -0,0 +1,35 @@ +public class BubbleSortExample { + static void bubbleSort(int[] arr) { + int n = arr.length; + int temp = 0; + for(int i=0; i < n; i++){ + for(int j=1; j < (n-i); j++){ + if(arr[j-1] > arr[j]){ + + temp = arr[j-1]; + arr[j-1] = arr[j]; + arr[j] = temp; + } + + } + } + + } + public static void main(String[] args) { + int arr[] ={30,45,12,2,89,3,400}; + + System.out.println("Array Before Bubble Sort"); + for(int i=0; i < arr.length; i++){ + System.out.print(arr[i] + " "); + } + System.out.println(); + + bubbleSort(arr); + + System.out.println("Array After Bubble Sort"); + for(int i=0; i < arr.length; i++){ + System.out.print(arr[i] + " "); + } + + } +} From e23133c4de5fc85e4f9085d12ab473d497f267a2 Mon Sep 17 00:00:00 2001 From: tandrimasingha <78292851+tandrimasingha@users.noreply.github.com> Date: Sat, 2 Oct 2021 17:49:06 +0530 Subject: [PATCH 4/4] Create Bubble_sort.java --- Java_peograms/Bubble_sort.java | 35 ++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 Java_peograms/Bubble_sort.java diff --git a/Java_peograms/Bubble_sort.java b/Java_peograms/Bubble_sort.java new file mode 100644 index 0000000000..47e054676f --- /dev/null +++ b/Java_peograms/Bubble_sort.java @@ -0,0 +1,35 @@ +public class BubbleSortExample { + static void bubbleSort(int[] arr) { + int n = arr.length; + int temp = 0; + for(int i=0; i < n; i++){ + for(int j=1; j < (n-i); j++){ + if(arr[j-1] > arr[j]){ + + temp = arr[j-1]; + arr[j-1] = arr[j]; + arr[j] = temp; + } + + } + } + + } + public static void main(String[] args) { + int arr[] ={3,60,35,2,45,320,5}; + + System.out.println("Array Before Bubble Sort"); + for(int i=0; i < arr.length; i++){ + System.out.print(arr[i] + " "); + } + System.out.println(); + + bubbleSort(arr);//sorting array elements using bubble sort + + System.out.println("Array After Bubble Sort"); + for(int i=0; i < arr.length; i++){ + System.out.print(arr[i] + " "); + } + + } +}