Learnerslesson
   JAVA   
  SPRING  
  SPRINGBOOT  
 HIBERNATE 
  HADOOP  
   HIVE   
   ALGORITHMS   
   PYTHON   
   GO   
   KOTLIN   
   C#   
   RUBY   
   C++   




KOTLIN - LINEAR SEARCH CODE




Example :



class LinearSearch {

    fun search(arr: Array<Int>, n: Int): Int {

        var len = arr.size;
        for(i in 0..(len-1)) {

            if(arr[i] == n)
                return i;
        }
        return -1;
    }
}

fun main(arr: Array<String>) {

    var arr = arrayOf(5, 3, 6, 2, 1, 4);

    var n = 2;// Element to be searched.

    print("The Array elements are : ");

    for (i in 0..(arr.size-1))
        print("${arr[i]}, ");

    println("\nElement to be searched : $n");

    var linearSearch = LinearSearch();

    var index = linearSearch.search(arr, n);

    if(index == -1)
        print("Element is not present in the array");
    else
        print("The element $n is present at index $index");
}


Output :



  The Array elements are : 5, 3, 6, 2, 1, 4,
  Element to be searched : 2
  The element 2 is present at index 3

The above code is quite simple,


We will be searching the element 2,


var n = 2;// Element to be searched.

From the array,


var arr = arrayOf(5, 3, 6, 2, 1, 4);

Next, we pass the array and the element 2, to the search(...) method.


var index = linearSearch.search(arr, n);

Explanation of the 'fun search(arr: Array<Int>, n: Int): Int' method :


fun search(arr: Array<Int>, n: Int): Int {

	var len = arr.size;
	for(i in 0..(len-1)) {

		if(arr[i] == n)
			return i;
	}
	return -1;
}

We need to search the element 2 from the below array.

java_Collections

So, we run a for loop. Starting from the 1st location to the end of the array.


for(i in 0..(len-1)) {
	if(arr[i] == n)
		return i;
}

And at every step, we keep on checking if the element is present in the array or not.


	if(arr[i] == n)
		return i;

If we find the element, we return that particular location.


return i;
java_Collections


But, what if we are searching for an element that is not present in the array?


Say, we are searching for number 8. Which is not present in the array.


In that case, we return -1.


return -1;

Which states the number is not found.


Finally, the returned value is stored in the index variable.


var index = linearSearch.search(arr, n);

And we print it using :


print("The element $n is present at index $index");

Output :



  The Array elements are : 5 3 6 2 1 4
  Element to be searched : 2
  The element 2 is present at index 3