bubble--sort in c.

                  BUBBLE SORT PROGRAM IN C

WE ALL KNOW BUBBLE SORT PROGRAM ,IT IS VERY SIMPLE AND EASY.IT IS USED IN SORTING OF NUMBERS ENTERED IN AN ARRAY THAT IS WHY MOST OF US PREFER THIS LOGIC.HERE, IS MY ALGORITHM.


 PROGRAM :-



OUTPUT :-

THIS IS THE  ALGORITHM FOR BUBBLE-SORT IT IS USED FOR ARRANGEMET OF SET OF NUMBERS IN ASCENDING ORDER.BUT,THE MAIN DRAWBACK OF THIS BUBBLE-SORT IS THAT TIME-COMPLEXITY.

WE ALL WELL AWARE OF TIME-COMPLEXITY IS THAT THE TIME TAKEN BY THE ALGORTHIM TO  RUN AS FUNCTION OF LENGTH OF THE INPUT.

THE TIME-COMPLEXITY OF THE ABOVE ALGORTHIM IS  :-  O(n^2).

THAT IS THE MAIN REASON IS THAT IT TAKES A LOT OF TIME WHEN INPUT IS LARGE.THAT IS WHY,QUICK SORT AND INSERTION SORT CAME INTO EXISTENCE.

THE SPACE-COMPLEXITY OF MY ALGORITHM IS O(1).

IF U HAVE ANY DOUBTS  AND FOR CODE EXPLANATION PLEASE COMMENT BELOW.

Protected by Copyscape

Comments

Post a Comment

Popular posts from this blog

BIRTHDAY PARTY

SOLUTION FOR BIRTHDAY PARTY HACKEREARTH Mr. X's birthday is in next month. This time he is planning to invite N of his friends. He wants to distribute some chocolates to all of his friends after party. He went to a shop to buy a packet of chocolates. At chocolate shop, each packet is having different number of chocolates. He wants to buy such a packet which contains number of chocolates, which can be distributed equally among all of his friends. Help Mr. X to buy such a packet. Input: First line contains T, number of test cases. Each test case contains two integers, N and M. where is N is number of friends and M is number number of chocolates in a packet. Output: In each test case output "Yes" if he can buy that packet and "No" if he can't buy that packet. Constraints: 1<=T<=20 1<=N<=100 1<=M<=10^5 SAMPLE INPUT   2 5 14 3 21 SAMPLE OUTPUT   No Yes SOLUTION : #include<stdio.h> int main(){
Read more

spoj CPTTRN1 - Character Patterns (Act 1) solution

Image
Using two characters: . (dot) and * (asterisk) print a chessboard-like pattern. The first character printed should be * (asterisk). Input You are given  t < 100  - the number of test cases and for each of the test cases two positive integers:  l  - the number of lines and  c  - the number of columns in the pattern ( l ,  c  < 100). Output For each of the test cases output the requested pattern (please have a look at the example). Use one line break in between successive patterns. Example Input: 3 3 1 4 4 2 5 Output: * . * *.*. .*.* *.*. .*.* *.*.* .*.*.    
Read more

ROY AND PROFILE PICTURE

Image
   THE SOLUTION FOR ROY AND PROFILE PICTURE QUESTION : Roy wants to change his profile picture on Facebook. Now Facebook has some restriction over the dimension of picture that we can upload. Minimum dimension of the picture can be  L x L , where  L  is the length of the side of square. Now Roy has  N  photos of various dimensions. Dimension of a photo is denoted as  W x H   where  W  - width of the photo and  H  - Height of the photo When any photo is uploaded following events may occur: [1] If any of the width or height is less than L, user is prompted to upload another one. Print " UPLOAD ANOTHER " in this case. [2] If width and height, both are large enough and  (a) if the photo is already square then it is accepted. Print " ACCEPTED " in this case. (b) else user is prompted to crop it. Print " CROP IT " in this case. (quotes are only for clarification) Given L, N, W and H as input, print appropriate text as output. Input: Firs
Read more