data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAKAAAAB4CAYAAAB1ovlvAAADk0lEQVR4nO3cP0iUcRzH8UdCtMyUXMKCQoqwqQwVIQIj819DRC5peBIiCSVaZNoRNFTwIEkOuejWIkKLnqLgnIN0IIeDgqOLq4Mg3LfpxOu81Hye+zx47xd81+/3Gd4ot/wcA4Qc9QcguxEgpAgQUgQIKQKEFAFCigAhRYCQIkBIESCkCBBSBAgpAoQUAeJAsVjMt90EiENxVhrNWWm02y/qLB6Pe7fXs0040aampnYjTEzJdJMNDAwcK0gCxKEVLTSnRJiYgrc3bX19/cg7CRCHcrqrPCm4M2N3bGJi4th7CRAH6u7vseKFZnv1vs/z3QQIKQKEFAFCigAhRYCQIkBIESCkCBBSBAgpAoQUAUKKACFFgJAiQEgRIKQIEFIEiBSRSMTa2jszcosAsa+rFQ3m1AybUzNs56p6bXR01Jc7BIi0zlb370a4d05dbrKlpSVPbhAg0iqq6iNAaFyvuLcbXEFVv3399t2XOwSIFJFIxB497c7ILQKEFAFCigAhRYCQkga4urpqzxtKbGNjI2M3C6enLT8ctpmZmYzdRHryv4BbW1sWG3J2p7OtyfebTjSaNKWtrba5uen7XaSSB2hmNjIykhRhYn68Pm+u6/py8+8IE5MTjVplba0vN5Eq0AH+fFdkw+5Hz+/lh8Mp4eUODtrc/Lznt/Bv8gD3/gv+7ebZy/Y6X+/Vd3SYE41a8eSkhV3X0+dmcXTyHyEDLUUZ+xGytrZGcAEj/wuI7EaAkCJASBEgpAgQUgQIKQKEFAFCigAhRYCQIkBIESCkCBBSBAgpAoQUAUKKACFFgJAiQEgRIKQIEFIECCkChBQBQooAIUWAkCJASBEgpAgQUoEKsHCo3PLbL/J8bhYJVIBmZs5YWdKUNl/j+dwTLHABmqVGmJicsTKrvFut/rysMTs76/t7ioELMD90KSW83GcXbG5+Tv1pWclxQ+a4Ict5cMt+LS56v9/zjcdQ39pszliZFX+6YeHPH3jNNCASEe6d8oe1trOzc/zdHnyfJ3g+N7i63/TuG6Hjhqyg77GNj4//9+7ABIhgWl5eTgou70vIWnq6PNtPgEgrHo+b44bsypP7tr297csNAoQUAUKKACFFgJAiQEgRIKQIEFIECCkChBQBQooAIUWAkCJASBEgpAgQUgQIKQKEFAFCigAhRYCQIkBIESCkCBBSBAgpAoQUAUKKACFFgJAiQEgRIKQIEFJ/AFS6sixBZCy3AAAAAElFTkSuQmCCdata:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAeAAAAFoCAYAAACPNyggAAACtUlEQVR4nO3BMQEAAADCoPVPbQwfoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA+Bo3+AAF/RMkcAAAAAElFTkSuQmCCLet's do the things that make up bubble sort!

c2b11

reports item containign search term

counter1Returns a sorted version of the input list. You can then set that list equal to what this reports, or you can use this in other ways.

counter1Returns a sorted version of the input list. You can then set that list equal to what this reports, or you can use this in other ways.counter1

1. Your first task is to set variable A to the value of variable B, and variable B to the value of variable A. Your code should work regardless of what values the variables have. (That's why they're randomized) This is a very simple task, but it might actually be simpler than you think! You may make as many other variables as you need. This task can be done with three lines of code (it can also be done with more). 1. 您的第一个任务是将变量 A 设置为变量 B 的值，将变量 B 设置为变量 A 的值。无论变量具有什么值，代码都应工作。（这就是为什么他们被随机化的原因）这是一个非常简单的任务，但实际上可能比您想象的要简单！您可以根据需要制作尽可能多的其他变量。此任务可以使用三行代码完成（也可以用更多代码完成）。 You can see how I did this in the Bubblesort list block! 你可以看到我是如何这样做的，在泡泡排序列表块！

2. Now you are to do the same thing for the two items in this list. You can see the items in the list by using the block "say (example list) for (x) secs" Remember, since this is a list, we can't use the "set [variable] to (value)" block to change a single item in the list. There are several ways to do this, but I would recommend the "replace item (x) of [list] with [value]" block! 2. 现在，您将对列表中的两个项目执行相同的操作。您可以使用块"say (example list) for (x) secs"来查看列表中的项目。请记住，由于这是一个列表，因此不能使用"set [variable] to (value)" 块来更改列表中的单个项。有几种方法可以做到这一点，但我建议[列表]的"replace item (x) of [list] with [value]" 块！

3. Now do the same thing you did in part 2, but have it switch ONLY if the items aren't already sorted smallest to largest! You can copy your code over from part 2. Just edit that block, then drag and drop it here. Then click cancel on your part 2 block so you don't lose your code! You will want to use an "if <condition>" block to do this, plus a one of the green operator blocks!

4. This list is guaranteed to need sorting, and will be sorted after just one pass! You will make code that does the following: checks the first two items, swaps them if needed checks the last two items, swaps them if needed You can do this with a program which only works on this task. Or you can make a complete sorting algorith that will work on a list of any length. Your choice After you have sorted the list, include a "say (example list) for (5) secs" block so we can see the result!. 4. 此列表保证需要排序，并且只需一次处理后就进行排序！您将编写执行以下操作的代码：检查前两个项目，根据需要交换它们检查最后两个项目，根据需要交换它们您可以使用仅适用于此任务的程序执行此操作。或者，您可以进行完整的排序 algorith，该排序将处理任何长度的列表。您的选择对列表进行排序后，请包括一个 "say (example list) for (5) secs" 块，以便我们可以看到结果！

When you swapped items, you were creating the metaphorical "bubbles" of bubblesort. What you need to do now is take that bubble and move it along the entire length of the list. You need to check and swap items 1 and 2, then items 2 and 3, and so on, to the end of the list. You will want to use repeat blocks. You will need to use a counter variable to keep track of which list item you are looking at. You will need to use a variable to store a value while you change list item values. You are definitely going to need a "length of [list]" block! (or code that does the same thing!) If you complete this task, you will have a fully-working bubble sort! Note:Take a look at my completed bubblesort block. It is possible for you to adapt that code to work here. But you can't just drag and drop! It doesn't use the same variables! You'll notice that on one of my "repeat" blocks I say "length of list - 1" Why -1? If there are 5 items in the list, you can't compare item 5 to item 6. When we get to the last item in the list, there is nothing to switch with. Weird things happen if we try. 交换项目时，您正在创建气泡的隐喻"气泡"。你现在需要做的是取这个气泡，然后沿着列表的整个长度移动它。您需要检查和交换项目 1 和 2，然后项目 2 和 3，等等，到列表的末尾。您需要使用重复块。您需要使用计数器变量来跟踪您正在查看的列表项。更改列表项值时，需要使用变量存储值。你肯定需要一个""length of [list]"块！（或执行相同事情的代码！如果您完成此任务，您将有一个完全工作的气泡排序！注意：看看我已完成的气泡状块。您可以调整该代码以在此处工作。但你不能只是拖拉！它不使用相同的变量！你会注意到，在我的一个 "repeat" 块，我说"length of list - 1" 为什么-1？如果列表中有 5 个项目，则无法将项目 5 与项目 6 进行比较。当我们到达列表中的最后一个项目时，没有什么可切换的。如果我们尝试，奇怪的事情就会发生。

bag,4ball,7bread,8dog,12egg,14elephant,26episode,27harpy eagle,29helicopter,33jaguar,36jet,38leopard,44manatee,45monkey,46otter,48penguin,49quagga,55rabbit,59reptile,60robot,62rutabaga,67vacuum,73vicuna,78voxel,84yellowjacket,90yogurt,97Q,T,T,U,N,N,H,P,R,G