AndroidSketchpad

welcome to this post. Today I am going to talk about Searching Algorithms. In this tutorial, I will cover 3 Searching Algorithms Linear Search Binary Search Interpolation Search So Let start with Linear Search Linear Search: From the name, you can get an idea. It searches linearly. One by one. This algorithm starts the search from the beginning and continues until finding the desired search index. For example, Assume an array from 0 to 10. and you are searching for10. so what will happen? First,...

Welcome to this post. In this post, we are going to learn about the Circular queue. If you don't know the queue data structure, please check this post Queue. In the previous post of Queue, I discuss the problem about the queue. So today we learn about the circular queue. In queue, to data in the queue, the method is called enqueue()   and to get data from the queue, the...

Welcome to this post. This is the second post about data Structure. In this post, we are going to learn about Queue data structure. In the previous post, we discuss Stack. Stack is FILO type data structure. But Queue is the FIFO data structure, that means the data enter first that also come first. Src: Wikipedia In queue, to data in the queue, the method is called enqueue()   and...

Welcome to this post. This is going to be a series post about data structure and algorithm, In this series, I use kotlin as a default language. Let's start with stack data structure- Stack is a simple data structure. The implementation of this data structure is also called LIFO that means Last in Fast out. Basically, in this data structure, the last data will come in first. Src: Wikipedia In...