9. Searching in an array where adjacent differ at most k

-

9. Searching in an array where adjacent differ at most k


Problem link :- click here


package program;

public class Searching__9
{
	/*
	 	A step array is an array of integers where each element has a difference 
	 	of at most diff with its neighbor. 
	 	Given a key 'key', we need to find the index value of key if multiple-element
	 	exists to return the first occurrence of the key.
	 			arr[] = {4, 5, 6, 7, 6} 	diff = 1	key = 6
	 			output : 2
	 			
	 	 we will check the first element than we will jump to the index where there
	 	 is a chance of finding the element 
	 */
	
	static int search(int arr[], int n, int diff, int key)
	{
		int i=0; 
		while(i < n)
		{
			if(arr[i] == key)
				return i;
			
			int diff1 = Math.abs(arr[i] - key);
			i = i + Math.max(1, diff1/diff);
		}
		
		return -1;
	}
	

	public static void main(String[] args)
	{
		int arr[] = {20, 40, 50, 70, 70, 60};
		int diff = 20;
		int key = 50;
		int ans = search(arr, key, diff, key);
		if(ans == -1)
			System.out.println("Not found");
		else
			System.out.println("Element found at : " + ans);
	}

}

Time complexity :- O(n)
Space complexity :- O(1)

Comments

Post a Comment

Popular posts from this blog

4.Sort an array of 0's, 1's & 2's.

-
Image
4.Sort an array of 0's, 1's & 2's. Problem link :- click here C code #include<stdio.h> void swap(int *a, int *b) { int temp; temp = *a; *a = *b; *b = temp; } void sort_012(int A[], int n) { int i, j, m; i = 0; j = n-1; m = 0; while(m<=j) { if(A[m] == 0) { swap(&A[i], &A[m]); i++; m++; } else if(A[m] == 1) { m++; } else { swap(&A[j], &A[m]); j--; } } } void main() { int arr[30]; int n, i; printf("Enter the size of the array\n"); scanf("%d",&n); printf("Enter the elements of the array(only 0, 1, or 2)\n"); for(i=0; i<n; i++) scanf("%d",&arr[i]); printf("Given Array\n"); for(i=0; i<n; i++) printf("\t%d",arr[i]); printf("\n...
Read more

1. Reverse

-
Image
1. Reverse the Array.   Problem link :- Reverse the array Algorithm idea :- C code //Reverse the array #include<stdio.h> void rev_arr(int arr[], int start, int end) { int temp; while(start < end) { temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } void print_arr(int arr[], int size) { int i; for(i=0; i<size; i++) printf("\t%d",arr[i]); printf("\n"); } void main() { int arr1[30]; int n, i; printf("Enter the size of the array\n"); scanf("%d",&n); printf("Enter the elements of the array\n"); for(i=0; i<n; i++) scanf("%d",&arr1[i]); printf("Array before reversing\n"); print_arr(arr1, n); rev_arr(arr1, 0, n-1); printf("\nArray after reversing\n"); print_arr(arr1, n); } Java code //Reverse the array package programs;...
Read more

3. Height of Binary tree

-
3. Height of Binary tree Problem link :- click here package Binary_Tree; public class BinaryTree__3 { static int heightOfTree(Node root) { if(root == null) return 0; int left_height = heightOfTree(root.left); int right_height = heightOfTree(root.right); return Math.max(left_height, right_height) + 1; } public static void main(String[] args) { BinaryTree tree = new BinaryTree(); int arr[] = {2, -1, 3, -1, -1, 3}; tree.root = tree.createTree(arr, 0); int ans = heightOfTree(tree.root); System.out.println("Height : " + ans); } } Time complexity :- O(n) Space complexity :- O(n)
Read more