Try that list sort code with numbers between 1 and 20.
Does it still work?
Did Copilot mention that the algorithm is a bubble sort?
Try that list sort code with numbers between 1 and 20.
Does it still work?
Did Copilot mention that the algorithm is a bubble sort?
[quote="Mr_YouTuber_Official, post:39, topic:84454"]
@The_K_Studio .
[/quote]I haven't tested the numbers, but my immediate need is to alphabetize my library's book list by removing the @The_K_Studio extension, which is currently producing a false positive from Microsoft Defender. Yes, it's a bubble sort.
Yes, I've seen these blocks but can't figure out how to make them work. I haven't found any practical examples online, so I asked Professor Copilot to explain how a programmer works and what solutions there are for my simple need to sort a list of books without an extension. This routine allowed me to understand the strategy, and I noticed an unexpected behavior in the Replace block, which doesn't swap the two elements but simply replaces the second with the first. So I'll end up with two identical elements, one after the other. So I had to store the first element in a variable that I'll write as the second element after the first swap.
Thanks for the suggestions. By the way, bubble sort crashes with a list of over 1200 titles because it's obviously not suited to sorting lists of this size. I solved the problem with a brick...