Sorting Techniques: Complexity, Stability, and Cases

This content discusses various sorting techniques, their time complexity in worst, best, and average cases, stability, and types of sorts. It includes a comparison table listing algorithms such as Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, and more, along with their respective complexities. The content also covers stable and unstable sort algorithms, a table of complexity of sorting, and provides insights into different types of sorts.

• Sorting Techniques
• Time Complexity
• Stable Algorithms
• Worst Case
• Average Case

jazlyn Follow

Uploaded on Aug 03, 2024 | 0 Views

Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

Presentation Transcript

1. TIME COMPLXITY OF SORTING TECHNIQUES

2. SORTING

3. STABLE SORT ALGORITHMS

4. UNSTABLE SORT ALGORITMS

6. WORST, BEST & AVERAGE CASES

7. TYPES OF SORT

8. TABLE OF COMPLXITY OF SORTING.

9. SR.NO ALGORITHM WORST CASE BEST CASE AVERAGE CASE IS STABLE ? 1 BUBBLE O(n2) O(n2) O(n2) YES 2 SELECTION O(n2) O(n2) O(n2) YES 3 INSERTION O(n2) O(n) O(n2) YES 4 QUICK O(n2) O(nlogn) O(nlogn) YES 5 SHELL O(nlogn) O(n1.5) O(n1.5) NO 6 HEAP O(nlogn) O(nlogn) O(nlogn) NO 7 REDIX O(n) O(n) O(n) YES 8 BUCKET O(n) O(n) O(n) YES 9 MERGE O(nlogn) O(nlogn) O(nlogn) YES

10. THANK YOU