Computer sciencebubble sorting algorithm
Download as pptx, pdf0 likes18 views
The document explains sorting as the process of arranging elements in a specific order, highlighting internal and external sorting types. It covers various sorting techniques, particularly focusing on bubble sort, its algorithm, and analysis of best and worst cases regarding efficiency. Key factors for selecting sorting techniques include coding time, execution time, and memory requirements.
1 of 12
Download to read offline
![ Consider following array A of elements.
A
A[0] A[1] A[2] A[3] A[4]
Begin the sort by comparing first two elements
Compare A[0] and A[1]. Since 30>10, interchange
Compare A[1] and A[2]. Since 30>5, interchange Pass 1
Compare A[2] and A[3]. Since 30>20, interchange
Compare A[3] and A[4]. Since 30>15, interchange
Largest element 30 has bubble up to last position
30 10 5 20 15
30 10 5 20 15
10 30 5 20 15
10 5 30 20 15
10 5 20 30 15
10 5 20 15 30](https://image.slidesharecdn.com/bubblesort-240711050720-8a4fe616/85/Computer-sciencebubble-sorting-algorithm-7-320.jpg)
![Compare A[0] and A[1]. Since 10>5, interchange
Compare A[1] and A[2]. Since 10<20, no interchange Pass 2
Compare A[2] and A[3]. Since 20>15, interchange
Second largest element bubbles up to the position last but one.
Compare A[0] and A[1]. Since 5<10, no interchange
Pass 3
Compare A[1] and A[2]. Since 10<15, no interchange
Third largest element is in its right position.
Compare A[0] and A[2]. Since 5>10, no interchange Pass 4
Final sorted array after n-1 passes.
10 5 20 15 30
5 10 20 15 30
5 10 20 15 30
5 10 15 20 30
5 10 15 20 30
5 10 15 20 30
5 10 15 20 30
5 10 15 20 30
5 10 15 20 30](https://image.slidesharecdn.com/bubblesort-240711050720-8a4fe616/85/Computer-sciencebubble-sorting-algorithm-8-320.jpg)
![Algorithm:
Algorithm: BUBBLE_SORT(A, n) This algorithm sort a given array A[n] using bubble sort technique. Variables I and J are
used to index the array and temp is a temporary variable.
Step1: start
Step2: Input the array A[n]
Step3: [Compute the sorting]
Repeat For I0 to n-1
Step4: [Compare the adjacent elements]
Repeat For J0 to n-1-I
Step5: If (A[J]>A[J+1])
[Interchange A[J] and A[J+1]]
TempA[J]
A[J]A[J+1]
A[J+1]temp
[End If]
[End step3 for loop]
[End step4 for loop]
Step6: [Display output]
Repeat For I0 to n-1
Output A[I]
[End for]
Step9: stop](https://image.slidesharecdn.com/bubblesort-240711050720-8a4fe616/85/Computer-sciencebubble-sorting-algorithm-9-320.jpg)
Ad
Recommended
Sorting algorithms
Sorting algorithmsCHANDAN KUMAR This document provides an overview of sorting algorithms. It defines sorting as arranging data in a particular order like ascending or descending. Common sorting algorithms discussed include bubble sort, selection sort, insertion sort, merge sort, and quick sort. For each algorithm, the working method, implementation in C, time and space complexity is explained. The document also covers sorting terminology like stable vs unstable sorting and adaptive vs non-adaptive algorithms. Overall, the document serves as a comprehensive introduction to sorting and different sorting techniques.
Data Structure (MC501)
Data Structure (MC501)Kamal Singh Lodhi The document provides an overview of several sorting algorithms, including insertion sort, bubble sort, selection sort, and radix sort. It describes the basic approach for each algorithm through examples and pseudocode. Analysis of the time complexity is also provided, with insertion sort, bubble sort, and selection sort having worst-case performance of O(n^2) and radix sort having performance of O(nk) where k is the number of passes.
Data structure using c module 3
Data structure using c module 3smruti sarangi The document provides an overview of data structures and algorithms in 'C', focusing on searching, sorting, and hashing techniques. It details searching methods like linear and binary search, their algorithms, and various sorting techniques such as selection sort, bubble sort, and merge sort, along with their corresponding algorithms. Additionally, it discusses hashing concepts such as hash tables, hash functions, and collision resolution strategies.
Unit III Version I.pptx
Unit III Version I.pptxssuserd602fd The document discusses various sorting and searching algorithms. It begins by introducing selection sort, insertion sort, and bubble sort. It then covers merge sort and explains how it works by dividing the list, sorting sublists recursively, and merging the results. Finally, it discusses linear/sequential search and binary search, noting that sequential search checks every element while binary search repeatedly halves the search space.
Ijcse13 05-01-048
Ijcse13 05-01-048vital vital The document proposes a novel sorting algorithm that has a time complexity of O(n) in the best case and O(n2) in the worst case. It compares three elements at a time and rearranges them, similar to bubble sort but moving a smaller element left as well as a larger element right. Experiments show it outperforms bubble sort for larger data sets, with a runtime of 4859.96 seconds for 50,000 elements compared to 10311.56 seconds for bubble sort. The algorithm is analyzed and shown to meet its proposed time complexities.
Ijcse13 05-01-048
Ijcse13 05-01-048vital vital The document proposes a novel sorting algorithm that has a time complexity of O(n) in the best case and O(n2) in the worst case. It compares three elements at a time and rearranges them, similar to bubble sort but moving a smaller element left as well as a larger element right. Experiments show it outperforms bubble sort for larger data sets, with a runtime of 4859.96 seconds for 50,000 elements compared to 10311.56 seconds for bubble sort. The algorithm is analyzed and shown to meet its proposed time complexities.
Sorting
SortingBHARATH KUMAR The document discusses various sorting algorithms, highlighting their objectives, methodologies, memory requirements, and efficiency in terms of time and space complexity. It categorizes algorithms into O(n²) and O(n log n) classes and explains properties such as stability and adaptability. Examples include bubble sort, selection sort, insertion sort, merge sort, and quicksort, each with accompanying pseudocode and explanations.
Selection Sort with Improved Asymptotic Time Bounds
Selection Sort with Improved Asymptotic Time Boundstheijes The document presents an improved selection sort algorithm that enhances the classical selection sort by reducing its worst-case time complexity from O(n^2) to O(n * sqrt(n)). This improvement is achieved by processing the input data in blocks and keeping track of the minimum elements within these blocks to optimize searching. Experimental results demonstrating the faster performance of the improved algorithm are discussed, comparing it with classical sorting methods like bubble sort and insertion sort.
simple-sorting algorithms
simple-sorting algorithmsRavirajsinh Chauhan Bubble sort, selection sort, and insertion sort are O(n^2) sorting algorithms discussed in the document. Bubble sort compares and swaps adjacent elements, selection sort finds the minimum element and swaps it into place each iteration, and insertion sort inserts each new element into the sorted portion of the array. Merge sort is more efficient at O(n log n) time by dividing the array into halves, sorting them, and merging the results. It is well-suited for large datasets that do not fit into memory.
Sorting algorithms bubble sort to merge sort.pdf
Sorting algorithms bubble sort to merge sort.pdfAyeshaMazhar21 The document discusses various sorting algorithms, including selection sort, insertion sort, bubble sort, mergesort, and quicksort, outlining their procedures and efficiency. Each algorithm is analyzed in terms of key comparisons and moves, with performance characterized in best, worst, and average cases, often represented as O(n²) for simpler algorithms. The document emphasizes the necessity of efficient sorting techniques for organizing data, particularly focusing on internal sorting algorithms.
Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Comparative Performance Analysis & Complexity of Different Sorting Algorithmpaperpublications3 This document reviews various sorting algorithms including bubble sort, selection sort, insertion sort, and merge sort, analyzing their performance in terms of time complexity. It concludes that while simpler algorithms like bubble and selection sort are easier to implement, merge sort is more efficient for larger datasets. The execution time showed merge sort outperforms the others, particularly with larger lists, while bubble sort is the slowest.
my docoment
my docomentNeeshanYonzan Sorting arranges elements in a list in a specified order. There are two categories of sorting: internal sorting, where all data fits in memory, and external sorting, where data exceeds memory. Common sorting algorithms include insertion sort and selection sort. Insertion sort iterates through a list and inserts each element in its sorted position, having O(n2) time complexity in worst case. Selection sort selects the minimum element and places it at the front on each pass, also with O(n2) worst case time complexity.
Algorithm By AMT.pptx
Algorithm By AMT.pptxAungMyintTun3 This document discusses algorithms and sorting. It begins by defining an algorithm as a precise set of instructions for solving a problem or completing a task. Algorithms can be expressed as flowcharts or pseudocode. Sorting is introduced as arranging elements in an array in a relevant order like ascending or descending. Selection sort is provided as an example sorting algorithm. It works by iterating through the array, finding the minimum value, and swapping it into the sorted position. The example shows selection sort sorting an array of numbers in ascending order over three iterations.
Chapter3.pptx
Chapter3.pptxASMAALWADEE2 The greedy choice at each step is to select the talk that ends earliest among the compatible options. This maximizes the chance of fitting additional talks into the schedule.
Selection sort
Selection sortasra khan Selection sort is an in-place comparison sorting algorithm that works as follows: (1) Find the minimum value in the list, (2) Swap it with the value in the first position, (3) Repeat for the remainder of the list. It has a time complexity of O(n2), making it inefficient for large lists. While simple, it has advantages over more complex algorithms when auxiliary memory is limited. Variants include heapsort, which improves efficiency, and bingo sort, which is more efficient for lists with duplicate values.
Sorting algorithums > Data Structures & Algorithums
Sorting algorithums > Data Structures & AlgorithumsAin-ul-Moiz Khawaja The document discusses sorting algorithms including bubble sort, selection sort, insertion sort, and merge sort. It provides pseudocode and explanations of how each algorithm works. Bubble sort, selection sort, and insertion sort have O(n2) runtime and are best for small datasets, while merge sort uses a divide-and-conquer approach to sort arrays with O(n log n) runtime, making it more efficient for large datasets. Radix sort is also discussed as an alternative sorting method that is optimized for certain data types.
SIMPLE SORTING MUKUND
SIMPLE SORTING MUKUNDMukund Trivedi The document outlines and compares three simple sorting algorithms: bubble sort, selection sort, and insertion sort. It provides pseudocode and examples for each algorithm. Bubble sort and selection sort are analyzed and shown to have an O(n2) running time, as does insertion sort. While all three algorithms have quadratic runtime, insertion sort is generally the fastest for small arrays.
Alternate Sort
Alternate SortIOSR Journals This document presents a new sorting algorithm called 'alternate sort' designed to efficiently arrange data elements in sorted order. The algorithm utilizes a unique comparison technique and includes a detailed description of its working, examples, and a program listing. The efficiency of the algorithm is similar to that of bubble sort, making it suitable for small-sized arrays.
Daa chapter5
Daa chapter5B.Kirron Reddi The document introduces algorithms for sorting and searching tasks. It discusses sequential search, binary search, selection sort, bubble sort, merge sort, and quick sort algorithms. For each algorithm, it provides pseudocode to describe the steps, an example, and analysis of time complexity in the best, worst and average cases. The time complexities identified are Θ(n) for sequential search average case, Θ(log n) for binary search, Θ(n2) for selection, bubble and quick sort worst cases, and Θ(n log n) for merge and quick sort average cases.
Data Structures 6
Data Structures 6Dr.Umadevi V The document discusses various sorting algorithms including exchange sorts like bubble sort and quicksort, selection sorts like straight selection sort, and tree sorts like heap sort. For each algorithm, it provides an overview of the approach, pseudocode, analysis of time complexity, and examples. Key algorithms covered are bubble sort (O(n2)), quicksort (average O(n log n)), selection sort (O(n2)), and heap sort (O(n log n)).
Dsa – data structure and algorithms sorting
Dsa – data structure and algorithms sortingsajinis3 This document summarizes several sorting algorithms: bubble sort, insertion sort, selection sort, quicksort, merge sort, and radix sort. For each algorithm, it provides a high-level description of the approach, pseudocode for the algorithm, and time complexities. The key points are that sorting algorithms arrange data in a certain order, different techniques exist like comparing adjacent elements or dividing and merging, and the time complexities typically range from O(n log n) for efficient algorithms to O(n^2) for less efficient ones.
Algo PPT.pdf
Algo PPT.pdfsheraz7288 The document compares the performance of heap sort and insertion sort algorithms using different sized data sets. It implements both algorithms and analyzes their time complexities in best, average, and worst cases. The results show that insertion sort performs better on small and average sized data, while heap sort scales better to large data sets and has more consistent performance across cases. Heap sort is generally more suitable than insertion sort when sorting large amounts of data.
Data Structures_ Sorting & Searching
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).pptx
DS - Unit 2 FINAL (2).pptxprakashvs7 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.
Sorting pnk
Sorting pnkpinakspatel The document discusses and compares several sorting algorithms: bubble sort, selection sort, insertion sort, merge sort, and quick sort. For each algorithm, it provides an explanation of how the algorithm works, pseudocode for the algorithm, and an analysis of the time complexity. The time complexities discussed are:
Bubble sort: O(N^2) in worst case, O(N) in best case
Selection sort: O(N^2)
Insertion sort: O(N^2) in worst case, O(N) in best case
Merge sort: O(N log N)
Quick sort: O(N log N) on average
Chalukyas of Gujrat, Solanki Dynasty NEP.pptx
Chalukyas of Gujrat, Solanki Dynasty NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India. This presentation has been made keeping in mind the students of undergraduate and postgraduate level. In this slide try to present the brief history of Chaulukyas of Gujrat up to Kumarpala To keep the facts in a natural form and to display the material in more detail, the help of various books, websites and online medium has been taken. Whatever medium the material or facts have been taken from, an attempt has been made by the presenter to give their reference at the end.
Chaulukya or Solanki was one of the Rajputs born from Agnikul. In the Vadnagar inscription, the origin of this dynasty is told from Brahma's Chauluk or Kamandalu. They ruled in Gujarat from the latter half of the tenth century to the beginning of the thirteenth century. Their capital was in Anahilwad. It is not certain whether it had any relation with the Chalukya dynasty of the south or not. It is worth mentioning that the name of the dynasty of the south was 'Chaluky' while the dynasty of Gujarat has been called 'Chaulukya'. The rulers of this dynasty were the supporters and patrons of Jainism.
Exploring Ocean Floor Features for Middle School
Exploring Ocean Floor Features for Middle SchoolMarie This 16 slide science reader is all about ocean floor features. It was made to use with middle school students.
You can download the PDF at thehomeschooldaily.com
Thanks! Marie
More Related Content
Similar to Computer sciencebubble sorting algorithm (20)
Selection Sort with Improved Asymptotic Time Bounds
Selection Sort with Improved Asymptotic Time Boundstheijes The document presents an improved selection sort algorithm that enhances the classical selection sort by reducing its worst-case time complexity from O(n^2) to O(n * sqrt(n)). This improvement is achieved by processing the input data in blocks and keeping track of the minimum elements within these blocks to optimize searching. Experimental results demonstrating the faster performance of the improved algorithm are discussed, comparing it with classical sorting methods like bubble sort and insertion sort.
simple-sorting algorithms
simple-sorting algorithmsRavirajsinh Chauhan Bubble sort, selection sort, and insertion sort are O(n^2) sorting algorithms discussed in the document. Bubble sort compares and swaps adjacent elements, selection sort finds the minimum element and swaps it into place each iteration, and insertion sort inserts each new element into the sorted portion of the array. Merge sort is more efficient at O(n log n) time by dividing the array into halves, sorting them, and merging the results. It is well-suited for large datasets that do not fit into memory.
Sorting algorithms bubble sort to merge sort.pdf
Sorting algorithms bubble sort to merge sort.pdfAyeshaMazhar21 The document discusses various sorting algorithms, including selection sort, insertion sort, bubble sort, mergesort, and quicksort, outlining their procedures and efficiency. Each algorithm is analyzed in terms of key comparisons and moves, with performance characterized in best, worst, and average cases, often represented as O(n²) for simpler algorithms. The document emphasizes the necessity of efficient sorting techniques for organizing data, particularly focusing on internal sorting algorithms.
Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Comparative Performance Analysis & Complexity of Different Sorting Algorithmpaperpublications3 This document reviews various sorting algorithms including bubble sort, selection sort, insertion sort, and merge sort, analyzing their performance in terms of time complexity. It concludes that while simpler algorithms like bubble and selection sort are easier to implement, merge sort is more efficient for larger datasets. The execution time showed merge sort outperforms the others, particularly with larger lists, while bubble sort is the slowest.
my docoment
my docomentNeeshanYonzan Sorting arranges elements in a list in a specified order. There are two categories of sorting: internal sorting, where all data fits in memory, and external sorting, where data exceeds memory. Common sorting algorithms include insertion sort and selection sort. Insertion sort iterates through a list and inserts each element in its sorted position, having O(n2) time complexity in worst case. Selection sort selects the minimum element and places it at the front on each pass, also with O(n2) worst case time complexity.
Algorithm By AMT.pptx
Algorithm By AMT.pptxAungMyintTun3 This document discusses algorithms and sorting. It begins by defining an algorithm as a precise set of instructions for solving a problem or completing a task. Algorithms can be expressed as flowcharts or pseudocode. Sorting is introduced as arranging elements in an array in a relevant order like ascending or descending. Selection sort is provided as an example sorting algorithm. It works by iterating through the array, finding the minimum value, and swapping it into the sorted position. The example shows selection sort sorting an array of numbers in ascending order over three iterations.
Chapter3.pptx
Chapter3.pptxASMAALWADEE2 The greedy choice at each step is to select the talk that ends earliest among the compatible options. This maximizes the chance of fitting additional talks into the schedule.
Selection sort
Selection sortasra khan Selection sort is an in-place comparison sorting algorithm that works as follows: (1) Find the minimum value in the list, (2) Swap it with the value in the first position, (3) Repeat for the remainder of the list. It has a time complexity of O(n2), making it inefficient for large lists. While simple, it has advantages over more complex algorithms when auxiliary memory is limited. Variants include heapsort, which improves efficiency, and bingo sort, which is more efficient for lists with duplicate values.
Sorting algorithums > Data Structures & Algorithums
Sorting algorithums > Data Structures & AlgorithumsAin-ul-Moiz Khawaja The document discusses sorting algorithms including bubble sort, selection sort, insertion sort, and merge sort. It provides pseudocode and explanations of how each algorithm works. Bubble sort, selection sort, and insertion sort have O(n2) runtime and are best for small datasets, while merge sort uses a divide-and-conquer approach to sort arrays with O(n log n) runtime, making it more efficient for large datasets. Radix sort is also discussed as an alternative sorting method that is optimized for certain data types.
SIMPLE SORTING MUKUND
SIMPLE SORTING MUKUNDMukund Trivedi The document outlines and compares three simple sorting algorithms: bubble sort, selection sort, and insertion sort. It provides pseudocode and examples for each algorithm. Bubble sort and selection sort are analyzed and shown to have an O(n2) running time, as does insertion sort. While all three algorithms have quadratic runtime, insertion sort is generally the fastest for small arrays.
Alternate Sort
Alternate SortIOSR Journals This document presents a new sorting algorithm called 'alternate sort' designed to efficiently arrange data elements in sorted order. The algorithm utilizes a unique comparison technique and includes a detailed description of its working, examples, and a program listing. The efficiency of the algorithm is similar to that of bubble sort, making it suitable for small-sized arrays.
Daa chapter5
Daa chapter5B.Kirron Reddi The document introduces algorithms for sorting and searching tasks. It discusses sequential search, binary search, selection sort, bubble sort, merge sort, and quick sort algorithms. For each algorithm, it provides pseudocode to describe the steps, an example, and analysis of time complexity in the best, worst and average cases. The time complexities identified are Θ(n) for sequential search average case, Θ(log n) for binary search, Θ(n2) for selection, bubble and quick sort worst cases, and Θ(n log n) for merge and quick sort average cases.
Data Structures 6
Data Structures 6Dr.Umadevi V The document discusses various sorting algorithms including exchange sorts like bubble sort and quicksort, selection sorts like straight selection sort, and tree sorts like heap sort. For each algorithm, it provides an overview of the approach, pseudocode, analysis of time complexity, and examples. Key algorithms covered are bubble sort (O(n2)), quicksort (average O(n log n)), selection sort (O(n2)), and heap sort (O(n log n)).
Dsa – data structure and algorithms sorting
Dsa – data structure and algorithms sortingsajinis3 This document summarizes several sorting algorithms: bubble sort, insertion sort, selection sort, quicksort, merge sort, and radix sort. For each algorithm, it provides a high-level description of the approach, pseudocode for the algorithm, and time complexities. The key points are that sorting algorithms arrange data in a certain order, different techniques exist like comparing adjacent elements or dividing and merging, and the time complexities typically range from O(n log n) for efficient algorithms to O(n^2) for less efficient ones.
Algo PPT.pdf
Algo PPT.pdfsheraz7288 The document compares the performance of heap sort and insertion sort algorithms using different sized data sets. It implements both algorithms and analyzes their time complexities in best, average, and worst cases. The results show that insertion sort performs better on small and average sized data, while heap sort scales better to large data sets and has more consistent performance across cases. Heap sort is generally more suitable than insertion sort when sorting large amounts of data.
Data Structures_ Sorting & Searching
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).pptx
DS - Unit 2 FINAL (2).pptxprakashvs7 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.
Sorting pnk
Sorting pnkpinakspatel The document discusses and compares several sorting algorithms: bubble sort, selection sort, insertion sort, merge sort, and quick sort. For each algorithm, it provides an explanation of how the algorithm works, pseudocode for the algorithm, and an analysis of the time complexity. The time complexities discussed are:
Bubble sort: O(N^2) in worst case, O(N) in best case
Selection sort: O(N^2)
Insertion sort: O(N^2) in worst case, O(N) in best case
Merge sort: O(N log N)
Quick sort: O(N log N) on average
Recently uploaded (20)
Chalukyas of Gujrat, Solanki Dynasty NEP.pptx
Chalukyas of Gujrat, Solanki Dynasty NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India. This presentation has been made keeping in mind the students of undergraduate and postgraduate level. In this slide try to present the brief history of Chaulukyas of Gujrat up to Kumarpala To keep the facts in a natural form and to display the material in more detail, the help of various books, websites and online medium has been taken. Whatever medium the material or facts have been taken from, an attempt has been made by the presenter to give their reference at the end.
Chaulukya or Solanki was one of the Rajputs born from Agnikul. In the Vadnagar inscription, the origin of this dynasty is told from Brahma's Chauluk or Kamandalu. They ruled in Gujarat from the latter half of the tenth century to the beginning of the thirteenth century. Their capital was in Anahilwad. It is not certain whether it had any relation with the Chalukya dynasty of the south or not. It is worth mentioning that the name of the dynasty of the south was 'Chaluky' while the dynasty of Gujarat has been called 'Chaulukya'. The rulers of this dynasty were the supporters and patrons of Jainism.
Exploring Ocean Floor Features for Middle School
Exploring Ocean Floor Features for Middle SchoolMarie This 16 slide science reader is all about ocean floor features. It was made to use with middle school students.
You can download the PDF at thehomeschooldaily.com
Thanks! Marie
Introduction to Generative AI and Copilot.pdf
Introduction to Generative AI and Copilot.pdfTechSoup In this engaging and insightful two-part webinar series, where we will dive into the essentials of generative AI, address key AI concerns, and demonstrate how nonprofits can benefit from using Microsoft’s AI assistant, Copilot, to achieve their goals.
This event series to help nonprofits obtain Copilot skills is made possible by generous support from Microsoft.
Analysis of Quantitative Data Parametric and non-parametric tests.pptx
Analysis of Quantitative Data Parametric and non-parametric tests.pptxShrutidhara2 This presentation covers the following points--
Parametric Tests
• Testing the Significance of the Difference between Means
• Analysis of Variance (ANOVA) - One way and Two way
• Analysis of Co-variance (One-way)
Non-Parametric Tests:
• Chi-Square test
• Sign test
• Median test
• Sum of Rank test
• Mann-Whitney U-test
Moreover, it includes a comparison of parametric and non-parametric tests, a comparison of one-way ANOVA, two-way ANOVA, and one-way ANCOVA.
Sustainable Innovation with Immersive Learning
Sustainable Innovation with Immersive LearningLeonel Morgado Prof. Leonel and Prof. Dennis approached educational uses, practices, and strategies of using immersion as a lens to interpret, design, and planning educational activities in a sustainable way. Rather than one-off gimmicks, the intent is to enable instructors (and institutions) to be able to include them in their regular activities, including the ability to evaluate and redesign them.
Immersion as a phenomenon enables interpreting pedagogical activities in a learning-agnostic way: you take a stance on the learning theory to follow, and leverage immersion to envision and guide your practice.
ABCs of Bookkeeping for Nonprofits TechSoup.pdf
ABCs of Bookkeeping for Nonprofits TechSoup.pdfTechSoup Accounting can be hard enough if you haven’t studied it in school. Nonprofit accounting is actually very different and more challenging still.
Need help? Join Nonprofit CPA and QuickBooks expert Gregg Bossen in this first-time webinar and learn the ABCs of keeping books for a nonprofit organization.
Key takeaways
* What accounting is and how it works
* How to read a financial statement
* What financial statements should be given to the board each month
* What three things nonprofits are required to track
What features to use in QuickBooks to track programs and grants
june 10 2025 ppt for madden on art science is over.pptx
june 10 2025 ppt for madden on art science is over.pptxroger malina art science is over -talk by roger malina for jack madden group
Final Sketch Designs for poster production.pptx
Final Sketch Designs for poster production.pptxbobby205207 Final Sketch Designs for poster production.
Overview of Off Boarding in Odoo 18 Employees
Overview of Off Boarding in Odoo 18 EmployeesCeline George When an employee leaves the company, Odoo provides a streamlined offboarding process to ensure all necessary steps are taken.
Rai dyansty Chach or Brahamn dynasty, History of Dahir History of Sindh NEP.pptx
Rai dyansty Chach or Brahamn dynasty, History of Dahir History of Sindh NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India. This presentation has been made keeping in mind the students of undergraduate and postgraduate level. To keep the facts in a natural form and to display the material in more detail, the help of various books, websites and online medium has been taken. Whatever medium the material or facts have been taken from, an attempt has been made by the presenter to give their reference at the end.
In the seventh century, the rule of Sindh state was in the hands of Rai dynasty. We know the names of five kings of this dynasty- Rai Divji, Rai Singhras, Rai Sahasi, Rai Sihras II and Rai Sahasi II. During the time of Rai Sihras II, Nimruz of Persia attacked Sindh and killed him. After the return of the Persians, Rai Sahasi II became the king. After killing him, one of his Brahmin ministers named Chach took over the throne. He married the widow of Rai Sahasi and became the ruler of entire Sindh by suppressing the rebellions of the governors.
PEST OF WHEAT SORGHUM BAJRA and MINOR MILLETS.pptx
PEST OF WHEAT SORGHUM BAJRA and MINOR MILLETS.pptxArshad Shaikh Wheat, sorghum, and bajra (pearl millet) are susceptible to various pests that can significantly impact crop yields. Common pests include aphids, stem borers, shoot flies, and armyworms. Aphids feed on plant sap, weakening the plants, while stem borers and shoot flies damage the stems and shoots, leading to dead hearts and reduced growth. Armyworms, on the other hand, are voracious feeders that can cause extensive defoliation and grain damage. Effective management strategies, including resistant varieties, cultural practices, and targeted pesticide applications, are essential to mitigate pest damage and ensure healthy crop production.
Paper 109 | Archetypal Journeys in ‘Interstellar’: Exploring Universal Themes...
Paper 109 | Archetypal Journeys in ‘Interstellar’: Exploring Universal Themes...Rajdeep Bavaliya Get ready to embark on a cosmic quest as we unpack the archetypal power behind Christopher Nolan’s ‘Interstellar.’ Discover how hero’s journey tropes, mythic symbols like wormholes and tesseracts, and themes of love, sacrifice, and environmental urgency shape this epic odyssey. Whether you’re a film theory buff or a casual viewer, you’ll learn why Cooper’s journey resonates with timeless myths—and what it means for our own future. Smash that like button, and follow for more deep dives into cinema’s greatest stories!
M.A. Sem - 2 | Presentation
Presentation Season - 2
Paper - 109: Literary Theory & Criticism and Indian Aesthetics
Submitted Date: April 5, 2025
Paper Name: Literary Theory & Criticism and Indian Aesthetics
Topic: Archetypal Journeys in ‘Interstellar’: Exploring Universal Themes in Nolan’s Cosmic Odyssey
[Please copy the link and paste it into any web browser to access the content.]
Video Link: https://youtu.be/vHLaLZPHumk
For a more in-depth discussion of this presentation, please visit the full blog post at the following link: https://rajdeepbavaliya2.blogspot.com/2025/04/archetypal-journeys-in-interstellar-exploring-universal-themes-in-nolan-s-cosmic-odyssey.html
Please visit this blog to explore additional presentations from this season:
Hashtags:
#ChristopherNolan #Interstellar #NolanFilms #HeroJourney #CosmicOdyssey #FilmTheory #ArchetypalCriticism #SciFiCinema #TimeDilation #EnvironmentalCinema #MythicStorytelling
Keyword Tags:
Interstellar analysis, Christopher Nolan archetypes, hero’s journey explained, wormhole symbolism, tesseract meaning, myth in sci-fi, cinematic archetypes, environmental themes film, love across time, Nolan film breakdown
Ray Dalio How Countries go Broke the Big Cycle
Ray Dalio How Countries go Broke the Big CycleDadang Solihin A complete and practical understanding of the Big Debt Cycle. A much more practical understanding of how supply and demand really work compared to the conventional economic thinking. A complete and practical understanding of the Overall Big Cycle, which is driven by the Big Debt Cycle and the other major cycles, including the big political cycle within countries that changes political orders and the big geopolitical cycle that changes world orders.
Battle of Bookworms 2025 - U25 Literature Quiz by Pragya
Battle of Bookworms 2025 - U25 Literature Quiz by Pragya Pragya - UEM Kolkata Quiz Club Battle of Bookworms is a literature quiz organized by Pragya, UEM Kolkata, as part of their cultural fest Ecstasia. Curated by quizmasters Drisana Bhattacharyya, Argha Saha, and Aniket Adhikari, the quiz was a dynamic mix of classical literature, modern writing, mythology, regional texts, and experimental literary forms. It began with a 20-question prelim round where ‘star questions’ played a key tie-breaking role. The top 8 teams moved into advanced rounds, where they faced audio-visual challenges, pounce/bounce formats, immunity tokens, and theme-based risk-reward questions. From Orwell and Hemingway to Tagore and Sarala Das, the quiz traversed a global and Indian literary landscape. Unique rounds explored slipstream fiction, constrained writing, adaptations, and true crime literature. It included signature IDs, character identifications, and open-pounce selections. Questions were crafted to test contextual understanding, narrative knowledge, and authorial intent, making the quiz both intellectually rewarding and culturally rich. Battle of Bookworms proved literature quizzes can be insightful, creative, and deeply enjoyable for all.
How to Configure Vendor Management in Lunch App of Odoo 18
How to Configure Vendor Management in Lunch App of Odoo 18Celine George The Vendor management in the Lunch app of Odoo 18 is the central hub for managing all aspects of the restaurants or caterers that provide food for your employees.
How to Manage & Create a New Department in Odoo 18 Employee
How to Manage & Create a New Department in Odoo 18 EmployeeCeline George In Odoo 18's Employee module, organizing your workforce into departments enhances management and reporting efficiency. Departments are a crucial organizational unit within the Employee module.
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024Quiz Club of PSG College of Arts & Science THE QUIZ CLUB OF PSGCAS BRINGS T0 YOU A FUN-FILLED, SEAT EDGE BUSINESS QUIZ
DIVE INTO THE PRELIMS OF BIZCOM 2024
QM: GOWTHAM S
BCom (2022-25)
THE QUIZ CLUB OF PSGCAS
Chalukyas of Gujrat, Solanki Dynasty NEP.pptx
Chalukyas of Gujrat, Solanki Dynasty NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India.
Rai dyansty Chach or Brahamn dynasty, History of Dahir History of Sindh NEP.pptx
Rai dyansty Chach or Brahamn dynasty, History of Dahir History of Sindh NEP.pptxDr. Ravi Shankar Arya Mahila P. G. College, Banaras Hindu University, Varanasi, India.
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024
BUSINESS QUIZ PRELIMS | QUIZ CLUB OF PSGCAS | 9 SEPTEMBER 2024Quiz Club of PSG College of Arts & Science
Ad
Computer sciencebubble sorting algorithm
- 2. SORTING Sorting is process of arranging the elements in a particular order. The order may be ascending order or descending order. The advantage of sorting is effective data accessing. Types of sorting: There are 2 types of sorting. 1. Internal sorting 2. External sorting Internal sorting: If all the elements (records) to be sorted are in the main memory then such a sorting is called internal sorting. External sorting: If some of the elements (records) to be sorted are in the secondary storage or disk such a sorting is called External sorting.
- 3. Types of sorting techniques: 1. Bubble sort (Exchange sort or Sinking sort). 2. Selection sort. 3. Insertion sort. 4. Quick sort. 5. Merge sort. 6. Heap sort. 7. Shell sort 8. Radix sort. 9. Address calculation sort.
- 4. Efficiency of a sorting technique: How to select a sorting technique for a given set of elements? There are number of sorting techniques available to sort a given array of data items. Each sorting technique has its own advantages and disadvantages. Different techniques are useful in different applications. There are 3 most important factors are counted while selecting a sorting technique, which are. 1. Coding time: The amount of time invested in writing full length sorting program. 2. Execution time (Time complicity): The amounts of time required execute the sorting program. This normally frequency of execution of statements in a program i.e. number of times statements are executed. 3. Memory requirement (Space complicity): The amount of memory required to store the entire sorting program in main memory while execution.
- 5. Analysis of a sorting technique: Analysis of a sorting technique depends of three factors, which are code time, time complicity and space complicity. Among these 3 factors while analyzing a sorting technique we mainly concentrate more on the time complicity. The time complicity is amount of time required to execute the sorting program. Which is analyzed in terms of 3 cases 1. Best case 2. Worst case 3. Average case
- 6. BUBBLE SORT It is most popular sorting technique among all other techniques because is very simple to understand and implement. It is also called exchange or sinking sort Working of Bubble Sort The algorithm begins by comparing the element at the bottom of the array with next element. If the first element is grater the second element, then are swapped or exchanged. This process in then repeated for next two elements i.e. for second and third element. After n-1 comparisons the largest of all data items bubbles up to the top of the array. The first n-1 comparisons constitute first pass. During second pass number of comparison is one les than previous pass i.e. there are n-2 comparisons in the second pass. During second pass second largest element bubbles up to the last but one position.
- 7. Consider following array A of elements. A A[0] A[1] A[2] A[3] A[4] Begin the sort by comparing first two elements Compare A[0] and A[1]. Since 30>10, interchange Compare A[1] and A[2]. Since 30>5, interchange Pass 1 Compare A[2] and A[3]. Since 30>20, interchange Compare A[3] and A[4]. Since 30>15, interchange Largest element 30 has bubble up to last position 30 10 5 20 15 30 10 5 20 15 10 30 5 20 15 10 5 30 20 15 10 5 20 30 15 10 5 20 15 30
- 8. Compare A[0] and A[1]. Since 10>5, interchange Compare A[1] and A[2]. Since 10<20, no interchange Pass 2 Compare A[2] and A[3]. Since 20>15, interchange Second largest element bubbles up to the position last but one. Compare A[0] and A[1]. Since 5<10, no interchange Pass 3 Compare A[1] and A[2]. Since 10<15, no interchange Third largest element is in its right position. Compare A[0] and A[2]. Since 5>10, no interchange Pass 4 Final sorted array after n-1 passes. 10 5 20 15 30 5 10 20 15 30 5 10 20 15 30 5 10 15 20 30 5 10 15 20 30 5 10 15 20 30 5 10 15 20 30 5 10 15 20 30 5 10 15 20 30
- 9. Algorithm: Algorithm: BUBBLE_SORT(A, n) This algorithm sort a given array A[n] using bubble sort technique. Variables I and J are used to index the array and temp is a temporary variable. Step1: start Step2: Input the array A[n] Step3: [Compute the sorting] Repeat For I0 to n-1 Step4: [Compare the adjacent elements] Repeat For J0 to n-1-I Step5: If (A[J]>A[J+1]) [Interchange A[J] and A[J+1]] TempA[J] A[J]A[J+1] A[J+1]temp [End If] [End step3 for loop] [End step4 for loop] Step6: [Display output] Repeat For I0 to n-1 Output A[I] [End for] Step9: stop
- 10. Analysis of bubble sort: Best case: If the given array of elements is in the ascending order, the outer for loop will be executed n-1 times. The inner for loop and if statement will be executed n-1 times for the first iteration of the outer for loop, n-2 times for the second iteration of the outer for loop and so on . Only one time during the n-1th iteration of the outer for loop. The interchange part will not be executed even once. Worst case: : If the given array of elements is in reverse order, the outer for loop will be executed n-1 times. The inner for loop, if statement and interchange part will be executed n-1 times for the first iteration of the outer for loop, n-2 times for the second iteration of the outer for loop and so on. Only one time during the n-1th iteration of the outer for loop. Hence maximum number of comparisons and interchange operations.
- 11. Advantages: 1. Simple to understand and implement. 2. Very straight forward. 3. Better than selection sort. Disadvantages: 1. It runs slowly and hence it is not efficient, because more efficient sorting techniques are available. 2. Even if array is sorted, n-1 comparisons are required.
Editor's Notes
- #7: Therefore array n elements requires n-1 passes