Android

Android is an open source and Linux based operating system for mobile devices such as smartphone and tablet computers.

WHY ANDROID

etc.

FEATURES OF ANDROID

Android is a powerful operating system computing with Apple 4GS and supports great features —

etc.


I am starting a new series about ANDROID and ANDROID APPLICATION DEVELOPMENT. In this series i will try to cover everything from Basics to Advanced level of Android Application Development.

Android

Directions : -

Future Plan : -

I will start the tutorial very soon

THANK YOU FOR YOUR TIME


In this article we will get to know about Interpolation Search

Interpolation Search

4. Interpolation Search :

Interpolation search is an improved version of binary search, where the values in a sorted array are uniformly distributed. Interpolation search may go to different location according to the value of the key being search. Binary search always go to the middle element to check.

Example : If the value of the key is closer to the last element, interpolation search is likely to start search toward the end side.

It uses following formula :-


In this article we will get to know about Jump Search.

Jump Search

3. Jump Search

Like binary search, jump search is a searching algorithm for sorted arrays. It works by first searching all items until an item is found that is larger than the search key. To find the exact position of the search key in the list a linear search is formed on the sublist. Jump search is better than linear search but worse than a binary search. The optimal value step size(m) is √n.

Lets consider this

arr[] = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144…


In this article we will get to know about Binary Search.

2. Binary Search :

Binary search also known as half-interval search, logarithmic search or binary chop, is a search algorithm that finds the position of a target value within a sorted array.


Linear Search

Linear Search :

A linear search scans one item at a time, without jumping to any item. The worst case complexity is O(n), sometimes known as O(n) search. Time taken to search elements keep increasing as the number of elements are increased. Linear search is less used today because it is slower than binary search and hashing.

A simple approach to do a linear search, i.e

Rajendra Mahato

Full stack android developer | Dhanbad | Bangalore, India

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store