Scribd
Upload
3 views

DAA PROJECT

Uploaded by

22f2000932
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

DAA PROJECT

Uploaded by

22f2000932
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

SORT

VISUALISATION
QUICK SORT,BUBBLE SORT,SELECTION SORT

DESIGN AND ANALYSIS OF ALGORITHM


21CSC204J
PRESENTED BY:
GANESH(RA2212704010031)
DEEPIKA ELSA(RA2212704010037)
AYUSH(RA2212704010029)
SORTING
1.Definition: Sorting in Data Structures and Algorithms (DSA)
refers to the process of arranging elements in a specific order,
typically in ascending or descending order.
2.Objective: The primary goal of sorting is to organize data for
efficient search, retrieval, and manipulation.
3.Key Concepts:
1. Comparison: Sorting often involves comparing elements
and rearranging them based on the result of these
comparisons.
2. Stability: Some sorting algorithms maintain the relative
order of equal elements in the sorted output, preserving
the original input order if
the values are the same.
SELECTION
SORT
1.Time Complexity:
1. Worst-Case: O(n^2) - Occurs when the input array is in reverse order,
resulting in repeated selections and swaps throughout the array.
2. Average-Case: O(n^2) - On average, Selection Sort performs the same
number of comparisons and swaps as in the worst case.
3. Best-Case: O(n^2) - Even in the best case, Selection Sort makes the same
number of comparisons and swaps as in other cases.
2.Space Complexity:
1. Selection Sort is an in-place sorting algorithm, requiring minimal additional
memory. Its space complexity is O(1).
3.Efficiency:
1. Selection Sort is not considered highly efficient, especially for large datasets,
due to its quadratic time complexity.
2. It is outperformed by more advanced sorting algorithms like Quick Sort or
Merge Sort in practical applications.
3. Main advantage: Simplicity and ease of implementation, making it suitable
for educational purposes.
4. Similar to Bubble Sort, it may be acceptable for small datasets or nearly
sorted data.
BUBBLE SORT
1.Time Complexity:
•Worst-Case: O(n^2) - Occurs when the input array is in reverse order,
requiring comparisons and swaps throughout the entire array.
•Average-Case: O(n^2) - On average, Bubble Sort performs the same number
of comparisons and swaps as in the worst case.
•Best-Case: O(n) - In the best case, with an already sorted input, Bubble Sort
makes only n comparisons and no swaps.
2.Space Complexity:
•Bubble Sort is an in-place sorting algorithm, requiring no additional memory
allocation. Its space complexity is O(1).
3.Efficiency:
•Bubble Sort is not efficient for large datasets due to its quadratic time
complexity.
•It is outperformed by advanced algorithms like Quick Sort or Merge Sort in
practical applications.
•Main advantage: Simplicity and ease of implementation, often used for
educational purposes.
•Suitable for small datasets or nearly sorted data where its performance can be
acceptable.
QUICK SORT
1.Time Complexity:
1. Worst-Case: O(n^2) - Can occur when the pivot selection consistently
results in unbalanced partitions, resembling insertion sort behavior.
2. Average-Case: O(n log n) - On average, Quick Sort exhibits efficient
performance, dividing the array into balanced partitions.
3. Best-Case: O(n log n) - Achieved when the pivot consistently divides the
array into nearly equal partitions.
2.Space Complexity:
1. Quick Sort is an in-place sorting algorithm, meaning it doesn't require
additional memory proportional to the input size. Its space complexity is
O(log n) due to the recursive call stack.
3.Efficiency:
1. Quick Sort is considered highly efficient, especially for large datasets, due to
its average-case time complexity of O(n log n).
2. It outperforms simpler algorithms like Bubble Sort and Selection Sort in most
practical scenarios.
3. Main advantage: Efficient average-case performance and relatively low
space requirements.
4. It is widely used in various applications and is one of the fastest sorting
algorithms in practice.

You might also like