Scribd
Upload
70 views11 pages

Presentation: Bitonic Sort: Presented By: Eng Zahir Ullah

Bitonic sort is a comparison-based sorting algorithm that sorts a data set by converting it into a bitonic sequence, where the numbers monotonically increase and then decrease. It breaks the list down into bitonic sequences and then slowly combines them into larger bitonic sequences using a merge function. The time complexity of bitonic sort is O(log2n) in all cases (best, average, worst), which is more efficient than other common algorithms like bubble sort and selection sort that have O(n2) time complexity in all cases.

Uploaded by

Zahir Ullah
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
70 views11 pages

Presentation: Bitonic Sort: Presented By: Eng Zahir Ullah

Bitonic sort is a comparison-based sorting algorithm that sorts a data set by converting it into a bitonic sequence, where the numbers monotonically increase and then decrease. It breaks the list down into bitonic sequences and then slowly combines them into larger bitonic sequences using a merge function. The time complexity of bitonic sort is O(log2n) in all cases (best, average, worst), which is more efficient than other common algorithms like bubble sort and selection sort that have O(n2) time complexity in all cases.

Uploaded by

Zahir Ullah
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/ 11

PRESENTATION: BITONIC SORT

Presented by: Eng Zahir Ullah


Bitonic Sort - Introduction

Bitonic Sort

Bitonic Sequences
What is a Bitonic sequence
How do we create a Bitonic sequence?
Bitonic Sort – Bitonic Sequences Sort -
Introduction

What is a Bitonic Sequences


A series of numbers that is first increasing and then decreasing

1 2 3 3 2 1
Increasing Decreasing
A data set is Bitonic if there exists an index I for which all
elements less than or equal to I are in increasing order and
all element greater than or equal to I are in decreasing order
Bitonic Sort – Bitonic Sequences Sort - Introduction

What is a Bitonic Sequences


A series of numbers that is first increasing and then decreasing

Entirely increasing Entirely Decreasing


1 2 3 3 2 1

Decreasing portion of Increasing portion of


the list is empty the list is Empty
Bitonic Sort – Creating Bitonic Sequences Sort - Introduction

How do we create a bitonic sequence?

Pick 2 Elements

Bitonic Sequence

5 2 3 10

Increasing Decreasing Increasing Decreasin


g
Bitonic Sort – Creating Bitonic Sequences Sort - Introduction

How do we create a bitonic sequence?


We can split any list into a series of valid
bitonic sequences
If we can convert two smaller bitonic
sequences and turn them into a larger bitonic
sequence
If we can convert two smaller bitonic
sequences and turn them into a larger bitonic
sequence
We have a way to convert any list into a bitonic
sequence
Bitonic Sequences
30, 70, 40, 80, 60, 20, 10, 50

30, 40, 70, 80, 60, 50, 20, 10


Bitonic Sort – Creating Bitonic Sequences Sort - Introduction

30 40 70 80 60 50 20 10

30 40 20 10 60 50 70 80

20 10 30 40 60 50 70 80

10 20 30 40 50 60 70 80
Bitonic Sort – Bitonic sort Basics - Introduction

Bitonic Sort

Break the list Slowly combine


down into Bitonic them into larger
sequences and larger Bitonic
Sequences

Bitonic Sort Bitonic Merge


Bitonic Sort – Bitonic sort Basics - Introduction

Bitonic Sort

Bitonic Sort
A comparison based sorting algorithm witch
sort a data set by converting the list of numbers into
a bitonic sequence
A series of number which monotonically increase
then decreases
The list is then sorted using a merge function
Bitonic Sort – Time Complexity Introduction

Case Time Complexity


Best Case O(log2n)

Average Case O(log2n)

Worst Case O(log2n)

The time complexity of bitonic sort is O (log2 n) in all three cases.

Case Time Complexity


Bubble Sort O(n2) in all case
Selection Sort O(n2) in all case
Bitonic Sort O(log2n)

You might also like