PureBasic Forums - English

Code: Select all

Procedure bubbleSort(Array arr.i(1))
  swapped.b = #True
  max.i = ArraySize(arr()) - 1
  
  While (swapped = #True)
    swapped = #False
    
    For i.i = 0 To max
      If arr(i) > arr(i + 1)
        temp.i = arr(i)
        arr(i) = arr(i + 1)
        arr(i + 1) =  temp
        
        swapped = #True
      EndIf
    Next i
    max = max - 1
  Wend
  
EndProcedure

OpenConsole()

size.l = 50000
PrintN("Bubble Sort Test..." + Str(size))

; Intialize array of random numbers
Dim bubs.i(size)
For i.i = 0 To size
  bubs(i) = Random(1000000)
Next

; Initial time
time.l = ElapsedMilliseconds()

; Sort using bubble sort
bubbleSort(bubs())

; Print time elapsed
PrintN("Time to Complete: " + Str(ElapsedMilliseconds() - time))

For i.i = 9000 To 9020
  PrintN(Str(bubs(i)))
Next i

Input()
CloseConsole()

Code: Select all

public class BubbleTest
{
    public static void main(String[] args)
    {
        final int size = 50000;

        System.out.println("Bubble Sort Test..." + size);
                
        int[] bubs = new int[size];
        for (int i = 0; i < size; i++)
            bubs[i] = (int) (Math.random() * 10000000);
        
        long time = System.currentTimeMillis();
        
        bubbleSort(bubs);
        
        System.out.println("Time to Complete: " + (System.currentTimeMillis() - time));
        
        for (int i = 2000; i < 2020; i++)
            System.out.println(bubs[i]);
    }
    
    public static void bubbleSort(int[] arr)
    {
        int len = arr.length;
        boolean swapped = true;
        
        while (swapped == true)
        {
            swapped = false;
            
            for (int i = 0; i < len - 1; i++)
            {
                if (arr[i] > arr[i + 1])
                {
                    int temp = arr[i];
                    arr[i] = arr[i + 1];
                    arr[i + 1] = temp;
                    
                    swapped = true;
                }
            }
            len--;
        }
    }
}

Code: Select all

       Swap arr(i), arr(i+1)
        ;temp.i = arr(i)
        ;arr(i) = arr(i + 1)
        ;arr(i + 1) =  temp
 

Code: Select all

ProcedureDLL.l TicksHQ() 
  Static maxfreq.q 
  Protected t.q 
  If maxfreq=0 
    QueryPerformanceFrequency_(@maxfreq) 
    maxfreq=maxfreq/1000
  EndIf 
  QueryPerformanceCounter_(@t) 
  ProcedureReturn t/maxfreq 
EndProcedure

OpenConsole()

size.l = 50000
PrintN("Bubble Sort Test..." + Str(size))

; Intialize array of random numbers
Dim bubs.i(size)
For i.i = 0 To size
  bubs(i) = Random(1000000)
Next

; Initial time
time.l = TicksHQ()

; Sort using bubble sort
SortArray(bubs(),#PB_Sort_Ascending)

; Print time elapsed
PrintN("Time to Complete: " + Str(TicksHQ() - time))

For i.i = 9000 To 9020
  PrintN(Str(bubs(i)))
Next i

Input()
CloseConsole()

Code: Select all

Dim bubs.i(Size)
For i.i = 0 To Size
  bubs(i) = Size - i
Next

Code: Select all

Structure IntegerTuple
	first.i
	second.i
EndStructure

Procedure ShieldBubbleSort(Array buffer.i(1))
	Protected swapped.i = #True
	Protected length.i = ArraySize(buffer()) - 1
	Protected counter.i
	Protected *base
	Protected *entry.IntegerTuple
	
	*base = @buffer()
	While swapped = #True
		swapped = #False
		
		*entry = *base
		For counter = 0 To length
			If *entry\first > *entry\second
				Swap *entry\first, *entry\second
				swapped = #True
			EndIf
			*entry + SizeOf(Integer)
		Next
		length = length - 1
	Wend
	
	ProcedureReturn #True
EndProcedure