In this tutorial, I am going to discuss the implementation of a Binary search using recursion in java.
Given an array of sorted integers and a number k. We have to write a code to search an element k in an array.
For example:
Input: {2, 3, 4, 5, 7, 8}, k = 5
Output: 3 (5 is found at 3rd index)
Input array is sorted and we have to find 5 in this array. The element is found at index 3.
In this tutorial, We are going to learn bubble sort algorithm and it’s implementation in java. We are going to discuss following points in this tutorial.
i) Bubble Sort Algorithm.
ii) Bubble sort program in java (How we can sort an unsorted array using bubble sort algorithm).
iii) Bubble sort video tutorial.
Given two sorted arrays, Write a java code to find intersection of two arrays.
For example, if the input arrays are:
arr1[] = {2, 3, 6, 7, 9, 11}
arr2[] = {4, 6, 8, 9, 12}
The common elements between these two arrays are {6, 9}.