What is Bubble Sort and How does it work?

Introduction to Sorting Algorithms:

Sorting Algorithms are procedures of reorganizing a large number of items into some specific order such as highest to lowest, or vice-versa, or even in some alphabetical order.

The algorithms take an input list, processes it (i.e, performs some operations on it) & produce the sorted list.

The most common example, we experience every day is sorting clothes or other items on an e-commerce website either by lowest-price to highest, or list by popularity, or some other order.

Bubble Sort:

This is one of the simplest Sorting Algorithm, & is very much necessary to learn as it represents the basic foundations of sorting, here we've tried to demystify this sorting algorithm.

Learn More: Link











Comments

Post a Comment

Popular posts from this blog

I credit Scaler Academy for where I am at today: Review by Software Engineer at Google

Image
Scaler Academy Learner, Anshul Jain shares her learning experience with us: "During my BTech and MTech years at Delhi’s Bhagwan Parshuram Institute of Technology (BPIT) and Netaji Subhas Institute of Technology (NSIT) respectively, I particularly enjoyed working on problems and learning more about Data Structures and Algorithms. In fact, I have been extremely interested in DS and Algo since high school. However, as much as I enjoyed my classes in college, I always felt the syllabus was too theoretical and that the teaching could have been more industry-specific. Later, while working at CaaStle in my first job as a front-end developer, I saw an ad for Scaler on Facebook and I immediately registered for the program. I used to attend DS and Algo coaching classes in college as well, hence, I knew that additional training would really hone my skills. In addition to DS and Algo training, I wanted to learn more about System Design as well at Scaler Academy. Check out the complete Review
Read more

Introduction to Pointers in C

What are Pointers in C?  A pointer is a variable that holds the address of another variable. A pointer is a derived data type in C. All the computers have addressable memory locations. The value of these variables is stored in these memories only. We can access these values of the variable in 2 ways: (i) By using the name of the variable. (ii) By using the address of a variable. The use of pointers are made in the second method Values stored in pointers are addresses, where data is stored in memory. Example:           int i = 8;           i → name of the variable           8 → value at address           65599 → address in the memory. How to Use Pointers in C? If we declare a variable i of type int, it will store a value.  int i = 0 The value of i is 0 now However, each variable, apart from value, also has its own address (or the address of the location where the value is saved in memory). The address can be retrieved by putting an ampersand (&) before the name of the variable. &
Read more

Scaler Academy Curriculum

Image
Scaler Academy's curriculum has been formulated keeping the following requirements in mind. - Good at Problem Solving - Ability to build a tech system from a real-world problem To ensure that each learner gets thorough knowledge of Computer Science fundamentals, and attains specialization in backend or full-stack while gaining proficiency in System Design (High-Level Design and Low-Level Design) through a project. Our batches are categorized basis on their proficiency: Beginner, Intermediate and Advanced. Experience Scaler Academy with our Free Trial .
Read more