ΘΕΜΑ: Bubblesort & binary search x_x ?

procedure  bubbleSort( A : list of sortable items )    n = length(A)    repeat       swapped = false      for i = 1 to n-1 inclusive do        /* if this pair is out of order */        if A[i-1] > A[i] then 
         /* swap them and remember something changed */          swap( A[i-1], A[i] )          swapped = true        end if      end for    until not swapped end procedure

int binary_search(int A[], int key, int imin, int imax) 
{  
  // continue searching while [imin,imax] is not empty 
 
  while (imax >= imin) 
     { 
      // calculate the midpoint for roughly equal partition 
 
      int imid = midpoint(imin, imax);        if(A[imid] == key) 
        // key found at index imid 
 
        return imid;  
       // determine which subarray to search       else if (A[imid] < key) 
         	// change min index to search 
	upper subarray          	imin = imid + 1;       else          
         	// change max index to search 
	lower subarray         imax = imid - 1; 
 
    } 
  // key was not found 	   
	return KEY_NOT_FOUND; 
 
}

def bubblesort(lista):
 
    mikos = len(lista) - 1
    taxinomisi = False
 
    while not taxinomisi:
        taxinomisi = True
        for i in range(mikos):
            if lista[i] > lista[i+1]:
                taxinomisi = False
                lista[i], lista[i+1] = lista[i+1], lista[i]
 
    return lista
 
 
if __name__ == '__main__':
    print(bubblesort([9, 11, 8, 40, 22, 5, 1, 60, 39]))
 
    my_list = ['Ελένη', 'Δήμητρα', 'Άρης', 'Κοιμωμένη', 'Ρίτσα', 'Αφροξυλάνθη']
 
    print(bubblesort(my_list))