Skip to main content

Bubble Sort Algorithm in PYTHON

What is Bubble Sort ? And why do we need this ?

Bubble sort is the simplest algorithm to sort any array.

Due to its simplicity, bubble sort is often used to introduce the concept of a sorting algorithm. 
In computer graphics it is popular for its capability to detect a very small error (like swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n). For example, it is used in a polygon filling algorithm, where bounding lines are sorted by their x coordinate at a specific scan line (a line parallel to x axis) and with incrementing y their order changes .

ALGORITHM :-

1.) Firstly we have an unsorted list, which is to be sorted.
2.) Consider the first element of the list. Then compare it with the next element.
3.) If the second element is greator than the first element than swap them.
4.) If the second element is smaller than the first element, then we don't have to do anything.
5.) Going ahead, now after swap (may or may not), look for second element, if it is greator than the next element than swap it otherwise leave it as it is.
6.) Now by following the above step for all the elements. Now run the loop again and again, and see if first is greator than second than swap otherwise leave it. And so on until the whole list is sorted.
7.) At last, we will get the sorted list.


DATA STRUCTURE :-






Hope you guys understood this topic. Share it with your friends and help them learning Python. In the next tutorial, we will learn the insertion sort algoritms which is more fun.




John Veer
Contact mail id  -  john.veer.utube@gmail.com
Contact us for any query.
Thank You for reading !

Comments

Post a Comment

Popular posts from this blog

Merge Sort Algorithm in PYTHON

  First of all, Why do we need to learn so many sorting algorithms? We need to learn so many sorting algorithms because there are cases in which which algorithm fits best. According to the time complexity, we have to choose an algorithm of our use. That's why we are learning so many sorting algorithms. SO LETS START WITH THE MERGE SORT In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. It is one of the most popular algorithms and one of the most stable sorting algorithm. ALGORITHM 1.) First of all take a list and put it in a function (recursion) that it breaks itself into two halves. 2.) When we get the two halves, the recursion code will automatically breaks the two halves into four             parts and then into 8 parts until each...
Post a Comment
Read more

Queues in PYTHON

  The Python Code for Queue is here :- class Node: def __init__(self, data): self.data = data self.next = None class Queue: def __init__(self): self.front = self.rear = None def enqueue(self, data): newnode = Node(data) newnode.next = self.rear self.rear = newnode if self.front is None: self.front = newnode def dequeue(self): temp = self.rear while temp.next is not self.front: temp = temp.next self.front = temp temp.next = None def traverse(self): temp = self.rear while temp is not None: print(temp.data, end = " --> ") temp = temp.next print("None") new = Queue() new.enqueue(4) new.enqueue(1) new.enqueue(0) new.enqueue(2) new.traverse() new.dequeue() new.traverse() new.dequeue() new.traverse() 2 --> 0 --> 1 --> 4 --> None 2 --> 0 --> 1 --> None 2 ...
1 comment
Read more