Few days ago, I attended an Android Interview for an MNC where I encountered an interesting coding question – Hackland Election. In this post, I would like to share it with you guys so that it might be helpful for your interview preparations. Here is the question in the similar lines that was asked during the interview: ” Hackland Election …
Quick Sort is based on divide and conquer algorithmic technique, similar to Merge Sort. In this tutorial, we will be looking at Quick Sort Kotlin Implementation. How Quick Sort Works? In Quick Sort, we will consider a random element of an array as pivot and partition the array into two – left part and right part. The main essence of …
Merge Sort is sorting based on Divide and Conquer strategy and is one of the famous algorithms among Sorting. In this article, we will be discussing about Merge Sort Kotlin Implementation. How Merge sort Works? Merge sort algorithm technique basically involves two processes – one process splits the array into two halves and sorts them individually. The other process involves …
Bubble Sort is the simplest Algorithm of all the sorting techniques. It compares two adjacent elements and swaps them if they are in wrong order. In this article we will focus on Bubble Sort Kotlin Implementation How Bubble Sort Works? Bubble sort works by iterating through the array of N elements, from the first element to the last, comparing each …
Selection Sort is one of the most important sorting algorithm frequently looked upon and is even asked in the Interviews. In this article we will look at Selection Sort Kotlin Implementation with example. Before diving into the code, let us see what is a Selection sort and Whether its efficient to use or not. What is a Selection Sort Selection sort is …
