Searching and sorting

Nov 28, 2022Download as PPTX, PDF2 likes4,527 views

Searching and sorting Types of Searching 1. Linear Searching 2. Binary Searching Types of Sorting 1.Selection Sort 2. Insertion Sort 3.Bubble Sort And the examples of Linear searching, Binary Searching And also the examples of Selection sort, Insertion sort and Bubble sort and describing them in detail in this ppt

SEARCHING
Searching is a method of finding
a element position from group of
elements in data structure, such as
array, linked list, tree or graph.

LINEAR SEARCH :
 Linear search is also called as sequential search.
 It is a basic and simple search algorithm.
 Linear search starts at the beginning of the list and
checks every element in the list.
 Linear search compares the element with all the other
elements given in the list. If the element is matched it
returns the valve index, else it returns -1.

HOW LINEAR SEARCH WORKS ?
Now, let's see the working of the linear search Algorithm.
let's take an unsorted array. It will be easy to understand the working of
linear search with an example.
Let the elements of array are -
Let the element to be searched is K = 41
Now, start from the first element and compare K with each element of the array.
The value of K, i.e., 41, is not matched with the first element of the
array. So, move to the next element. And follow the same process until
the respective element is found.

Now, the element to be searched is found. So algorithm will return
the index of the element matched.

BINARY SEARCH :
 Binary search is used for searching an element
in a sorted array.
 It is useful when there are large number of
element in an array.
 These searching technique looks for a
particular element by comparing the middle
most element of the collection.

How does Binary search work ?
Now, let’s see the working of the Binary search algorithm.
Let the elements of array are-
Let the element to be searched is, K=56

Now, the element to search is found. So algorithm will return
the index of the element matched.

SORTING :
Sorting is a method of
elements of array in a particular
format either ascending or
descending.

Insertion
sort
Selection
sort
Bubble
sort
Sorting

INSERTION SORTING :
 Insertion sort algorithm arranges a list of
elements.
 In Insertion sort algorithm every iteration
moves an element from unsorted to sorted
portion.
 Until all the elements are sorted in the list.
 This algorithm is not suitable for the large data
set.

SELECTION SORTING :
 In Selection sorting algorithm the first element
in the list is selected and it is compared with all
the remaining elements in the list.
 If any element is smaller than the selected
element then the both are swapped.
 So, the first position is filled with smallest
element.
 This procedure is repeated until the entire list
is sorted.

How does Selection sort work ?
Now, let's see the working of the Selection sort Algorithm.
To understand the working of the Selection sort algorithm, let's take an unsorted array.
Let the elements of array are –

BUBBLE SORTING :
 Bubble sort is the simplest sorting algorithm . It
always arrange the data in descending order.
 Bubble sort algorithm is not suitable for the
huge data set.
 Bubble sort algorithm compares two items at a
time and swapping them if they are in the
wrong order.
 The iteration is repeated until no swaps are
needed, which means list is sorted.

How does Bubble sort work ?
Now, let’s see the working of the Bubble sort
Algorithm. Suppose we have a list of array of 5 elements
A[5]={40,50,30,20,10}
Iteration-I:
A[0]=40 40 40 40 40 40
A[1]=50 50 50 30 30 30
A[2]=30 30 30 50 20 20
A[3]=20 20 20 20 50 10
A[4]=10 10 10 10 10 50

Iteration-II:
40 30 30 30
30 40 20 20
20 20 40 10
10 10 10 40
50 50 50 50
Iteration-III:
30 20 20
20 30 10
10 10 30
40 40 40
50 50 50

Iteration-IV:
20 10 10
10 20 20
30 30 30
40 40 40
50 50 50
Presented by:
Ch.Sreeja
Ch.Sandeep
K.Bhavani
S.Anil
R.Mounika

The document discusses various searching and sorting algorithms. It describes linear search, binary search, and interpolation search for searching unsorted and sorted lists. It also explains different sorting algorithms like bubble sort, selection sort, insertion sort, quicksort, shellsort, heap sort, and merge sort. Linear search searches sequentially while binary search uses divide and conquer. Sorting algorithms like bubble sort, selection sort, and insertion sort are in-place and have quadratic time complexity in the worst case. Quicksort, mergesort, and heapsort generally have better performance.

Constructors and DestructorsDr Sukhpal Singh Gill

Abstract class in javaLovely Professional University

Control structure C++Anil Kumar

The document discusses various control structures used in programming, including sequence, repetition (loops), and selection (branching). It covers common loop and conditional statements like while, for, if/else, switch/case. Control structures allow programs to execute instructions in different orders depending on conditions or to repeat steps multiple times. Keywords like break and continue change the normal flow of loops.

Fundamentals of Data Communication and Computer NetworksDr. Chandrakant Divate

Applications of Iot.pptxDhruv Kamal

The Internet of Things (IoT) is a term used to describe a network of interconnected devices that are able to communicate with each other and share data. These devices can be anything from smart appliances in your home to sensors in a manufacturing plant or even wearable devices like fitness trackers. The applications of IoT are numerous and continue to expand as technology advances. In this article, we'll explore some of the most important and interesting applications of IoT. Smart Homes and Buildings One of the most well-known applications of IoT is in smart homes and buildings. IoT devices can be used to control everything from temperature and lighting to security systems and home entertainment systems. Smart home devices can be controlled remotely through smartphones or other devices, and can even be automated based on the user's preferences and routines. Smart buildings take this concept a step further, with IoT sensors and systems used to optimize energy usage, monitor air quality, and even control elevators and other building systems. These applications can help reduce energy costs, improve safety, and enhance the overall user experience. Healthcare IoT has a variety of applications in the healthcare industry, from wearable devices that monitor vital signs to smart pills that track medication usage. IoT sensors can also be used to monitor patients in hospital settings, allowing medical staff to detect changes in a patient's condition more quickly and respond accordingly. In addition, IoT devices can be used for remote patient monitoring, allowing patients to receive care in their own homes rather than having to travel to a medical facility. This can improve patient outcomes and reduce healthcare costs. Agriculture IoT sensors and systems are increasingly being used in the agricultural industry to optimize crop yields and reduce waste. These sensors can be used to monitor soil moisture, temperature, and nutrient levels, allowing farmers to make more informed decisions about when and how to water and fertilize their crops. In addition, IoT systems can be used to track the movement and health of livestock, helping farmers to detect and respond to potential health issues more quickly. Manufacturing IoT is also being used in the manufacturing industry to improve efficiency and reduce waste. IoT sensors can be used to monitor equipment and machinery, providing real-time data on performance and identifying potential maintenance issues before they become more serious

DBMS Notes.pdfshubhampatel67739

DBMS allows users to manage databases. It provides interfaces to perform operations like creating databases, storing and updating data. Common DBMS include MySQL, Oracle, and SQL Server. The document then discusses different database models like hierarchical, network, relational and NoSQL databases. It also covers database concepts like data definition, data retrieval, data types, database normalization and database security.

Communal conflictsVellore Institute of Technology (VIT)

This document discusses the topic of communal conflicts in India. It begins by noting the rising trend of communalism and accompanying violence has created insecurity among religious minorities. It then provides definitions and dimensions of communalism, including assimilationist, welfarist, retreatist, retaliatory, separatist, and secessionist. The document discusses causes of communal conflicts such as social, religious, political, economic, and psychological factors. It also outlines features and consequences of communal riots as well as measures that can be taken to promote communal harmony.

sparse matrix in data structureMAHALAKSHMI P

This document discusses sparse matrices. It defines a sparse matrix as a matrix with more zero values than non-zero values. Sparse matrices can save space by only storing the non-zero elements and their indices rather than allocating space for all elements. Two common representations for sparse matrices are the triplet representation, which stores the non-zero values and their row and column indices, and the linked representation, which connects the non-zero elements. Applications of sparse matrices include solving large systems of equations.

Sorting AlgorithmsPranay Neema

This document discusses various sorting algorithms and their complexities. It begins by defining an algorithm and complexity measures like time and space complexity. It then defines sorting and common sorting algorithms like bubble sort, selection sort, insertion sort, quicksort, and mergesort. For each algorithm, it provides a high-level overview of the approach and time complexity. It also covers sorting algorithm concepts like stable and unstable sorting. The document concludes by discussing future directions for sorting algorithms and their applications.

Queue in Data Structure Janki Shah

Bubble sortManek Ar

queue & its applicationssomendra kumar

The document discusses different types of queues including their representations, operations, and applications. It describes queues as linear data structures that follow a first-in, first-out principle. Common queue operations are insertion at the rear and deletion at the front. Queues can be represented using arrays or linked lists. Circular queues and priority queues are also described as variants that address limitations of standard queues. Real-world and technical applications of queues include CPU scheduling, cashier lines, and data transfer between processes.

Circular link list.pptTirthika Bandi

This document provides information on circular linked lists including: - Circular linked lists have the last element point to the first element, allowing traversal of the list to repeat indefinitely. - Both singly and doubly linked lists can be made circular. Circular lists are useful for applications that require repeated traversal. - Types of circular lists include singly circular (one link between nodes) and doubly circular (two links between nodes). - Operations like insertion, deletion, and display can be performed on circular lists similarly to linear lists with some adjustments for the circular nature.

Data Structure (Queue)Adam Mukharil Bachtiar

Queue is a first-in first-out (FIFO) data structure where elements can only be added to the rear of the queue and removed from the front of the queue. It has two pointers - a front pointer pointing to the front element and a rear pointer pointing to the rear element. Queues can be implemented using arrays or linked lists. Common queue operations include initialization, checking if empty/full, enqueue to add an element, and dequeue to remove an element. The document then describes how these operations work for queues implemented using arrays, linked lists, and circular arrays. It concludes by providing exercises to implement specific queue tasks.

Queue data structureanooppjoseph

Introduction to stackvaibhav2910

Stacks are linear data structures that only allow insertion and deletion of elements from one end, called the top. Elements are inserted via a push operation and deleted via a pop operation. Stacks can be implemented using arrays, with a pointer tracking the top element. Common applications of stacks include reversing the order of elements and evaluating mathematical expressions by treating them as a postfix notation.

Data structures using cProf. Dr. K. Adisesha

The document discusses various data structures and their classification. It begins by stating the objectives of understanding how data structures can be classified, basic data types and arrays, and problem-oriented data structures used to solve specific problems. It then defines key terms like data, information, and data structures. It describes primitive and non-primitive, linear and non-linear data structures. It also discusses basic and problem-oriented data structures like lists, stacks, queues, and trees. It provides examples and applications of different data structures.

linked list in data structure shameen khan

This document discusses data structures and linked lists. It provides definitions and examples of different types of linked lists, including: - Single linked lists, which contain nodes with a data field and a link to the next node. - Circular linked lists, where the last node links back to the first node, forming a loop. - Doubly linked lists, where each node contains links to both the previous and next nodes. - Operations on linked lists such as insertion, deletion, traversal, and searching are also described.

PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...Umesh Kumar

The document discusses various sorting and searching algorithms: - Bubble sort, selection sort, merge sort, quicksort are sorting algorithms that arrange data in a particular order like numerical or alphabetical. - Linear search and binary search are searching algorithms where linear search sequentially checks each item while binary search divides the data set in half with each comparison. - Examples are provided to illustrate how each algorithm works step-by-step on sample data sets.

Bubble sort | Data structure |MdSaiful14

Bubble sort is a simple sorting algorithm that compares adjacent elements and swaps them if they are not in order. It has a worst-case and average time complexity of O(n2) where n is the number of items, making it inefficient for large data sets. The algorithm makes multiple passes through the array, swapping adjacent elements that are out of order until the array is fully sorted. It is one of the simplest sorting algorithms to implement but does not perform well for large data sets due to its quadratic time complexity.

Binary Search - Design & Analysis of AlgorithmsDrishti Bhalla

Binary search is an efficient algorithm for finding a target value within a sorted array. It works by repeatedly dividing the search range in half and checking the value at the midpoint. This eliminates about half of the remaining candidates in each step. The maximum number of comparisons needed is log n, where n is the number of elements. This makes binary search faster than linear search, which requires checking every element. The algorithm works by first finding the middle element, then checking if it matches the target. If not, it recursively searches either the lower or upper half depending on if the target is less than or greater than the middle element.

Linear search-and-binary-searchInternational Islamic University

This document provides an overview of linear search and binary search algorithms. It explains that linear search sequentially searches through an array one element at a time to find a target value. It is simple to implement but has poor efficiency as the time scales linearly with the size of the input. Binary search is more efficient by cutting the search space in half at each step. It works on a sorted array by comparing the target to the middle element and determining which half to search next. The time complexity of binary search is logarithmic rather than linear.

Linked ListAshim Lamichhane

a. Concept and Definition✓ b. Inserting and Deleting nodes ✓ c. Linked implementation of a stack (PUSH/POP) ✓ d. Linked implementation of a queue (Insert/Remove) ✓ e. Circular List • Stack as a circular list (PUSH/POP) ✓ • Queue as a circular list (Insert/Remove) ✓ f. Doubly Linked List (Insert/Remove) ✓ For more course related material: https://github.com/ashim888/dataStructureAndAlgorithm/ Personal blog www.ashimlamichhane.com.np

stack & queuemanju rani

This document discusses stacks and queues as linear data structures. It defines stacks as last-in, first-out (LIFO) collections where the last item added is the first removed. Queues are first-in, first-out (FIFO) collections where the first item added is the first removed. Common stack and queue operations like push, pop, insert, and remove are presented along with algorithms and examples. Applications of stacks and queues in areas like expression evaluation, string reversal, and scheduling are also covered.

Introduction to data structure pptNalinNishant3

In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. https://apkleet.com <a href="https://apkleet.com" >games apk </a>

Searching techniques in Data Structure And Algorithm03446940736

Array data structuremaamir farooq

Unit v data structure-convertedShri Shankaracharya College, Bhilai,Junwani

The document discusses various sorting techniques used in computer science. It describes insertion sort, selection sort, and merge sort. Insertion sort maintains a sorted sub-list and inserts new elements into the correct position within the sub-list. Selection sort divides the list into sorted and unsorted parts, selecting the minimum element from unsorted each time. Merge sort divides the list into halves recursively until single elements remain, then merges the halves back together in sorted order.

MODULE 5-Searching and-sortingnikshaikh786

This document provides information on various searching and sorting algorithms, including linear search, binary search, bubble sort, selection sort, and insertion sort. It begins with an overview of searching and describes linear and binary search algorithms. For linear search, it provides pseudocode and an example. For binary search, it also provides pseudocode and an example. The document then discusses sorting algorithms like bubble sort, selection sort, and insertion sort, providing descriptions, pseudocode, examples, and analyses of each.

More Related Content

What's hot (20)

sparse matrix in data structureMAHALAKSHMI P

Sorting AlgorithmsPranay Neema

Queue in Data Structure Janki Shah

Bubble sortManek Ar

queue & its applicationssomendra kumar

Circular link list.pptTirthika Bandi

Data Structure (Queue)Adam Mukharil Bachtiar

Queue data structureanooppjoseph

Introduction to stackvaibhav2910

Data structures using cProf. Dr. K. Adisesha

linked list in data structure shameen khan

PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...Umesh Kumar

Bubble sort | Data structure |MdSaiful14

Binary Search - Design & Analysis of AlgorithmsDrishti Bhalla

Linear search-and-binary-searchInternational Islamic University

Linked ListAshim Lamichhane

stack & queuemanju rani

Introduction to data structure pptNalinNishant3

Searching techniques in Data Structure And Algorithm03446940736

Array data structuremaamir farooq

sparse matrix in data structureMAHALAKSHMI P

Sorting AlgorithmsPranay Neema

Queue in Data Structure Janki Shah

Bubble sortManek Ar

queue & its applicationssomendra kumar

Circular link list.pptTirthika Bandi

Data Structure (Queue)Adam Mukharil Bachtiar

Queue data structureanooppjoseph

Introduction to stackvaibhav2910

Data structures using cProf. Dr. K. Adisesha

linked list in data structure shameen khan

PPT On Sorting And Searching Concepts In Data Structure | In Programming Lang...Umesh Kumar

Bubble sort | Data structure |MdSaiful14

Binary Search - Design & Analysis of AlgorithmsDrishti Bhalla

Linear search-and-binary-searchInternational Islamic University

Linked ListAshim Lamichhane

stack & queuemanju rani

Introduction to data structure pptNalinNishant3

Searching techniques in Data Structure And Algorithm03446940736

Array data structuremaamir farooq

Similar to Searching and sorting (20)

Unit v data structure-convertedShri Shankaracharya College, Bhilai,Junwani

MODULE 5-Searching and-sortingnikshaikh786

Searching Sortingguest2cb109

The document discusses different algorithms for searching and sorting arrays, including sequential search, binary search, selection sort, and bubble sort. It provides pseudocode examples and step-by-step explanations of how each algorithm works. Sequential search sequentially checks each element to find a match. Binary search repeatedly halves the search space. Selection sort finds the maximum element and swaps it into sorted position. Bubble sort repeatedly compares and swaps adjacent elements.

What is a Sorting Algorithm Ishank mini project.pptxSneakyGoblin1

This document discusses different types of sorting algorithms: - Sorting algorithms rearrange elements in a list into non-decreasing order by comparing elements. The main types are bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort. - Bubble sort works by comparing adjacent elements and swapping them if out of order, making multiple passes through the list. Selection sort selects the smallest element and moves it to the front on each pass. Insertion sort splits the list into sorted and unsorted parts, inserting unsorted elements into the sorted part. - Merge sort divides the list into halves and iteratively merges the sorted halves. Quicksort chooses a pivot element and partitions the list into sub-lists based on

BCA DATA STRUCTURES SEARCHING AND SORTING MRS.SOWMYA JYOTHISowmya Jyothi

1. The document discusses various searching and sorting algorithms. It describes linear search, which compares each element to find a match, and binary search, which eliminates half the elements after each comparison in a sorted array. 2. It also explains bubble sort, which bubbles larger values up and smaller values down through multiple passes. Radix sort sorts elements based on individual digits or characters. 3. Selection sort and merge sort are also summarized. Merge sort divides the array into single elements and then merges the sorted sublists, while selection sort finds the minimum element and swaps it into place in each pass.

Data Structures_ Sorting & SearchingThenmozhiK5

The document discusses various searching and sorting algorithms. It begins by defining searching as finding an item in a list. It describes sequential and binary search techniques. For sorting, it covers bubble, selection, insertion, merge, quick and heap sorts. It provides pseudocode examples and analyzes the time complexity of algorithms like selection sort and quicksort. Key aspects covered include the divide and conquer approach of quicksort and the efficiency of various sorting methods.

DS - Unit 2 FINAL (2).pptxprakashvs7

Searching,sortingLavanyaJ28

advanced searching and sorting.pdfharamaya university

Ch05 Black Jackleminhvuong

Sorting method data structuresunilchute1

This document discusses bubble sort, selection sort, and insertion sort algorithms. It provides descriptions of how each algorithm works, including pseudocode examples. Bubble sort compares adjacent element pairs and swaps them if out of order, taking Ο(n2) time. Selection sort finds the minimum element and swaps it into the sorted portion of the array in each pass. Insertion sort maintains a sorted sub-list, inserting new elements in the appropriate place to build the full sorted list.

Sorting types and AlgorithmsAli Khan

Chap10Terry Yoast

Selection Sort and Insertion Sorttamayaoraquel

This document discusses two sorting algorithms: selection sort and insertion sort. Selection sort works by finding the smallest element in the unsorted array and swapping it into the sorted position. This continues until the array is fully sorted. Insertion sort shifts elements in the sorted portion of the array to make room to insert new elements in sorted order. It is more efficient than selection sort for smaller datasets or datasets that are already partially sorted. Pseudocode and examples are provided to illustrate how each algorithm works.

Selection sort and insertion sortMay Ann Mendoza

Insertion sort & Linear Search presentationSaranshGupta923104

searchingA. S. M. Shafi

The document discusses two searching algorithms: linear search and binary search. Linear search sequentially compares an element to each element in an unsorted array, making it slower than binary search. Binary search works by dividing the search space in half at each step based on comparing the target element to the middle element. It is faster than linear search but requires the array to be sorted first. Key differences are that linear search works on unsorted data while binary search requires sorted data, and binary search has better time complexity of O(log n) while linear search is O(n).

arrays in cvidhi mehta

This document discusses different types of arrays and sorting/searching algorithms in C programming. It defines one-dimensional, two-dimensional, and multi-dimensional arrays. It also explains linear search, binary search, bubble sort, and selection sort algorithms - including their applications, merits, and demerits. Key array types include static arrays declared at compile-time with a fixed size, and dynamic arrays allocated at runtime using functions like malloc().

4.1 sequentioal searchKrish_ver2

1 D Arrays in C++poonam.rwalia

An array is a collection of variables of the same type that are referenced using a common name and contiguous memory locations. One-dimensional arrays allow storing multiple variables of the same type under a single variable name. Linear/sequential search compares each element to the search key while binary search divides the array in half at each step to find the search key faster than linear search.

Unit v data structure-convertedShri Shankaracharya College, Bhilai,Junwani

MODULE 5-Searching and-sortingnikshaikh786

Searching Sortingguest2cb109

What is a Sorting Algorithm Ishank mini project.pptxSneakyGoblin1

BCA DATA STRUCTURES SEARCHING AND SORTING MRS.SOWMYA JYOTHISowmya Jyothi

Data Structures_ Sorting & SearchingThenmozhiK5

DS - Unit 2 FINAL (2).pptxprakashvs7

Searching,sortingLavanyaJ28

advanced searching and sorting.pdfharamaya university

Ch05 Black Jackleminhvuong

Sorting method data structuresunilchute1

Sorting types and AlgorithmsAli Khan

Chap10Terry Yoast

Selection Sort and Insertion Sorttamayaoraquel

Selection sort and insertion sortMay Ann Mendoza

Insertion sort & Linear Search presentationSaranshGupta923104

searchingA. S. M. Shafi

arrays in cvidhi mehta

4.1 sequentioal searchKrish_ver2

1 D Arrays in C++poonam.rwalia

Recently uploaded (20)

Hands On: Create a Lightning Aura Component with force:RecordDataLynda Kane

SAP Modernization: Maximizing the Value of Your SAP S/4HANA Migration.pdfPrecisely

TrustArc Webinar: Consumer Expectations vs Corporate Realities on Data Broker...TrustArc

Most consumers believe they’re making informed decisions about their personal data—adjusting privacy settings, blocking trackers, and opting out where they can. However, our new research reveals that while awareness is high, taking meaningful action is still lacking. On the corporate side, many organizations report strong policies for managing third-party data and consumer consent yet fall short when it comes to consistency, accountability and transparency. This session will explore the research findings from TrustArc’s Privacy Pulse Survey, examining consumer attitudes toward personal data collection and practical suggestions for corporate practices around purchasing third-party data. Attendees will learn: - Consumer awareness around data brokers and what consumers are doing to limit data collection - How businesses assess third-party vendors and their consent management operations - Where business preparedness needs improvement - What these trends mean for the future of privacy governance and public trust This discussion is essential for privacy, risk, and compliance professionals who want to ground their strategies in current data and prepare for what’s next in the privacy landscape.

Rusty Waters: Elevating Lakehouses Beyond Sparkcarlyakerly1

Spark is a powerhouse for large datasets, but when it comes to smaller data workloads, its overhead can sometimes slow things down. What if you could achieve high performance and efficiency without the need for Spark? At S&P Global Commodity Insights, having a complete view of global energy and commodities markets enables customers to make data-driven decisions with confidence and create long-term, sustainable value. 🌍 Explore delta-rs + CDC and how these open-source innovations power lightweight, high-performance data applications beyond Spark! 🚀

Special Meetup Edition - TDX Bengaluru Meetup #52.pptxshyamraj55

Automation Dreamin': Capture User Feedback From AnywhereLynda Kane

Leading AI Innovation As A Product Manager - Michael JidaelMichael Jidael

Unlike traditional product management, AI product leadership requires new mental models, collaborative approaches, and new measurement frameworks. This presentation breaks down how Product Managers can successfully lead AI Innovation in today's rapidly evolving technology landscape. Drawing from practical experience and industry best practices, I shared frameworks, approaches, and mindset shifts essential for product leaders navigating the unique challenges of AI product development. In this deck, you'll discover: - What AI leadership means for product managers - The fundamental paradigm shift required for AI product development. - A framework for identifying high-value AI opportunities for your products. - How to transition from user stories to AI learning loops and hypothesis-driven development. - The essential AI product management framework for defining, developing, and deploying intelligence. - Technical and business metrics that matter in AI product development. - Strategies for effective collaboration with data science and engineering teams. - Framework for handling AI's probabilistic nature and setting stakeholder expectations. - A real-world case study demonstrating these principles in action. - Practical next steps to begin your AI product leadership journey. This presentation is essential for Product Managers, aspiring PMs, product leaders, innovators, and anyone interested in understanding how to successfully build and manage AI-powered products from idea to impact. The key takeaway is that leading AI products is about creating capabilities (intelligence) that continuously improve and deliver increasing value over time.

Automation Dreamin' 2022: Sharing Some Gratitude with Your UsersLynda Kane

Asthma presentación en inglés abril 2025 pdfVanessaRaudez

Cyber Awareness overview for 2025 month of securityriccardosl1

Automation Hour 1/28/2022: Capture User Feedback from AnywhereLynda Kane

2025-05-Q4-2024-Investor-Presentation.pptxSamuele Fogagnolo

"PHP and MySQL CRUD Operations for Student Management System"Jainul Musani

tecnologias de las primeras civilizaciones.pdffjgm517

Build Your Own Copilot & Agents For DevsBrian McKeiver

Network Security. Different aspects of Network Security.gregtap1

Enhancing ICU Intelligence: How Our Functional Testing Enabled a Healthcare I...Impelsys Inc.

DevOpsDays Atlanta 2025 - Building 10x Development Organizations.pptxJustin Reock

Building 10x Organizations with Modern Productivity Metrics 10x developers may be a myth, but 10x organizations are very real, as proven by the influential study performed in the 1980s, ‘The Coding War Games.’ Right now, here in early 2025, we seem to be experiencing YAPP (Yet Another Productivity Philosophy), and that philosophy is converging on developer experience. It seems that with every new method we invent for the delivery of products, whether physical or virtual, we reinvent productivity philosophies to go alongside them. But which of these approaches actually work? DORA? SPACE? DevEx? What should we invest in and create urgency behind today, so that we don’t find ourselves having the same discussion again in a decade?

Electronic_Mail_Attacks-1-35.pdf by xploitniftliyevhuseyn

Splunk Security Update | Public Sector Summit Germany 2025Splunk

Hands On: Create a Lightning Aura Component with force:RecordDataLynda Kane

SAP Modernization: Maximizing the Value of Your SAP S/4HANA Migration.pdfPrecisely

TrustArc Webinar: Consumer Expectations vs Corporate Realities on Data Broker...TrustArc

Rusty Waters: Elevating Lakehouses Beyond Sparkcarlyakerly1

Special Meetup Edition - TDX Bengaluru Meetup #52.pptxshyamraj55

Automation Dreamin': Capture User Feedback From AnywhereLynda Kane

Leading AI Innovation As A Product Manager - Michael JidaelMichael Jidael

Automation Dreamin' 2022: Sharing Some Gratitude with Your UsersLynda Kane

Asthma presentación en inglés abril 2025 pdfVanessaRaudez

Cyber Awareness overview for 2025 month of securityriccardosl1

Automation Hour 1/28/2022: Capture User Feedback from AnywhereLynda Kane

2025-05-Q4-2024-Investor-Presentation.pptxSamuele Fogagnolo

"PHP and MySQL CRUD Operations for Student Management System"Jainul Musani

tecnologias de las primeras civilizaciones.pdffjgm517

Build Your Own Copilot & Agents For DevsBrian McKeiver

Network Security. Different aspects of Network Security.gregtap1

Enhancing ICU Intelligence: How Our Functional Testing Enabled a Healthcare I...Impelsys Inc.

DevOpsDays Atlanta 2025 - Building 10x Development Organizations.pptxJustin Reock

Electronic_Mail_Attacks-1-35.pdf by xploitniftliyevhuseyn

Splunk Security Update | Public Sector Summit Germany 2025Splunk

Searching and sorting

1. SEARCHING AND SORTING

2. SEARCHING Searching is a method of finding a element position from group of elements in data structure, such as array, linked list, tree or graph.

4. LINEAR SEARCH :  Linear search is also called as sequential search.  It is a basic and simple search algorithm.  Linear search starts at the beginning of the list and checks every element in the list.  Linear search compares the element with all the other elements given in the list. If the element is matched it returns the valve index, else it returns -1.

5. HOW LINEAR SEARCH WORKS ? Now, let's see the working of the linear search Algorithm. let's take an unsorted array. It will be easy to understand the working of linear search with an example. Let the elements of array are - Let the element to be searched is K = 41 Now, start from the first element and compare K with each element of the array. The value of K, i.e., 41, is not matched with the first element of the array. So, move to the next element. And follow the same process until the respective element is found.

6. Now, the element to be searched is found. So algorithm will return the index of the element matched.

7. BINARY SEARCH :  Binary search is used for searching an element in a sorted array.  It is useful when there are large number of element in an array.  These searching technique looks for a particular element by comparing the middle most element of the collection.

8. How does Binary search work ? Now, let’s see the working of the Binary search algorithm. Let the elements of array are- Let the element to be searched is, K=56

9. Now, the element to search is found. So algorithm will return the index of the element matched.

10. SORTING : Sorting is a method of elements of array in a particular format either ascending or descending.

11. Insertion sort Selection sort Bubble sort Sorting

12. INSERTION SORTING :  Insertion sort algorithm arranges a list of elements.  In Insertion sort algorithm every iteration moves an element from unsorted to sorted portion.  Until all the elements are sorted in the list.  This algorithm is not suitable for the large data set.

13. How does Insertion sort work ?

14. SELECTION SORTING :  In Selection sorting algorithm the first element in the list is selected and it is compared with all the remaining elements in the list.  If any element is smaller than the selected element then the both are swapped.  So, the first position is filled with smallest element.  This procedure is repeated until the entire list is sorted.

15. How does Selection sort work ? Now, let's see the working of the Selection sort Algorithm. To understand the working of the Selection sort algorithm, let's take an unsorted array. Let the elements of array are –

16. Now, the array is completely sorted.

17. BUBBLE SORTING :  Bubble sort is the simplest sorting algorithm . It always arrange the data in descending order.  Bubble sort algorithm is not suitable for the huge data set.  Bubble sort algorithm compares two items at a time and swapping them if they are in the wrong order.  The iteration is repeated until no swaps are needed, which means list is sorted.

18. How does Bubble sort work ? Now, let’s see the working of the Bubble sort Algorithm. Suppose we have a list of array of 5 elements A[5]={40,50,30,20,10} Iteration-I: A[0]=40 40 40 40 40 40 A[1]=50 50 50 30 30 30 A[2]=30 30 30 50 20 20 A[3]=20 20 20 20 50 10 A[4]=10 10 10 10 10 50

19. Iteration-II: 40 30 30 30 30 40 20 20 20 20 40 10 10 10 10 40 50 50 50 50 Iteration-III: 30 20 20 20 30 10 10 10 30 40 40 40 50 50 50

20. Iteration-IV: 20 10 10 10 20 20 30 30 30 40 40 40 50 50 50 Presented by: Ch.Sreeja Ch.Sandeep K.Bhavani S.Anil R.Mounika

Searching and sorting

Recommended

More Related Content

What's hot (20)

Similar to Searching and sorting (20)

Recently uploaded (20)

Searching and sorting