🅰 Information Sorting Methods - BUBBLE - VECTORS - ARRAYS - LOOPS - Auxiliary Variable 🆗
In this lesson, we'll look at the bubble sort method, which is explained in the data structures course and is one of the many simpler methods for sorting information. More sophisticated and efficient methods exist, such as quicksort, but this example, which sorts 30 random numbers and generates the corresponding graph, is sufficient to understand the theory behind how to write sorting code. I'll explain several interesting commands or instructions, such as application, randbetween, wait, and more. I hope this will be useful as you begin your career as a professional programmer, since these topics are important for developing complex systems in any programming language, as the implementation is the same. However, most languages now include a single line of code for sorting information.