Bubble Sorting in data structure also known as exchange sort in which repeatedly list is sorted in which comparing two items at a time and swapping them if they wrong in order. Advantage of Bubble Sorting Disadvantage of Bubble Sort Bubble Sort in C++ Using Function The program specifies how to sort an array using […]
Bubble Sorting in Data Structure Read More »
What is Sorting in Data Structure Sorting algorithm in data structure refers to ordering data in both ascending and descending order to get a meaningful data which can be analyze easily. we formally define sorting problem as: Input: A sequence of n numbers <$a_{1}.a_{2}…………….a_{n}$> Output: A permutation (re-ordering) < $ a^{‘}_{1},a^{‘}_{2}…………………………..a^{‘}_{n}$> Example of Sorting Problem:
Sorting in Data Structure Read More »
Binary Search is a searching algorithm in data structure in which repeatedly the array is divided into half until the element to be searched is found. For Example: If we want to search 30 in the following Array: Step-1: Firstly the array is of 5 elements then it is divided by 2 that is 5/2
Binary Search in Data Structure Read More »
Linear Search also called sequential search in data structure which works by scanning one by one element in the list until the searched element is found. For Example: If we want to search 30 in the following Array: Step-1 : Firstly, 30 is compared to first element that is 10 Step-2: When not matched then
Linear Search in Data Structure Read More »
What is Searching: Searching in data structure help to find a element from any form of data structure where it is stored. Types of Searching: There are two types of searching which are as follows: Linear Searching “Linear search, also known as sequential search, is a method in which an element is searched by comparing
Searching in Data Structure Read More »