CoDeSys realizes bubble sorting

What is bubble sorting

           Bubble sort of English Bubble Sort, It's a basic sort of exchange . It's called bubble sorting , Because every element can be like a small bubble , According to their own size, point by point to Array Move to one side of the .

The principle of bubble sorting ：    

         Only one number can be determined in each trip . That is, the first trip can only confirm to return the number on the last bit , The second trip can only take the penultimate 2 The number on the bit returns , And so on . If there is n Number to sort , Just put the n-1 Return the number , That is to do n-1 Trip operation . and “ Every time ” It is necessary to compare two adjacent numbers from the first place , Put the larger number after , After the comparison, move back one bit and continue to compare the size relationship of the next two adjacent numbers , Repeat this step , Until the last number that hasn't returned .

How does it move ？ Here's a reference ( Handsome bubble sort )

（1） At the beginning , The left subscript points to the first stone , The right subscript points to the second stone , Then compare

（2） Then move the left and right subscripts to the right at the same time , Compare again

 （3） After the first trip , The largest stone moves to the far right

 （4） Next, there is nothing left 3 Continue to choose the largest among the stones that are not arranged in order , The rules are the same as above

 （5） This is given below 4 A complete demonstration process of stones

 

Don't talk much , With code on it ：

The first is to define variables ：

PROGRAM PLC_PRG
VAR
	// bubble sort 
	xButton0  					: BOOL ; 	// Sort start button 
	iBubbleSort1,iBubbleSort2 	: INT ;		// Bubbling cycle parameters 
	iSort_n,iSortNum1,iSortNum2 : INT ;		// Sort auxiliary parameters 
	arrDim1 : ARRAY[0..2,0..8] OF INT ;	// Tabular data 
END_VAR

The following is the bubble sort program ：

IF xButton0 THEN
	FOR iSort_n := 0 TO 8 BY 1 DO 
		arrDim1[1,iSort_n] := arrDim1[0,iSort_n] ;
		arrDim1[2,iSort_n] := arrDim1[0,iSort_n] ;
	END_FOR
	FOR iBubbleSort1 :=1 TO 8 BY 1 DO 
		FOR iBubbleSort2 :=0 TO (8-iBubbleSort1) BY 1 DO 
			IF arrDim1[1,iBubbleSort2] > arrDim1[1,iBubbleSort2+1] THEN // Ascending order 
				iSortNum1 := arrDim1[1,iBubbleSort2];
				arrDim1[1,iBubbleSort2] := arrDim1[1,iBubbleSort2+1];
				arrDim1[1,iBubbleSort2+1] := iSortNum1;
			END_IF
			IF arrDim1[2,iBubbleSort2] < arrDim1[2,iBubbleSort2+1] THEN // Descending order 
				iSortNum1 := arrDim1[2,iBubbleSort2];
				arrDim1[2,iBubbleSort2] := arrDim1[2,iBubbleSort2+1];
				arrDim1[2,iBubbleSort2+1] := iSortNum1;
			END_IF
		END_FOR
	END_FOR
	xButton0 := 0;
END_IF

Execute the program through a button , Realize the sorting of numbers , Make a visualization file , That's how it works ：

  Let's do the following , Please see the effect after running ：

  After running, it realizes the ascending and descending arrangement of numbers ————

As well as Python Bubble sort program ：

 

def bublle_sort(num):
    for i in range(1,len(num)):
        for n in range(0,len(num)-1):
            if num[n] < num[n+1]:
                num[n],num[n+1] = num[n+1],num[n]      
    return num

if __name__ == "__main__":
    num = [1,3,2,8,4,6]
    print(" The descending order is ：",bublle_sort(num))

  Running results ：

 The descending order is ： [8, 6, 4, 3, 2, 1]

         What about? , Does it feel codesys You can also make something different , I will continue to share different things with you in the future codesys, Let's industrial control people and play with the code , Next time I plan to use codesys Make an accumulator ！！