Structuri de Date 2023 - S4: Exercitiu partitie Quicksort

Structuri de Date 2023

Structuri de Date

Seminar 4

Algoritmii de partitie Hoare si Lomuto

int partition_Hoare(int* v, int st, int dr){ int pivot = v[alege_poz_pivot(v,st,dr)]; int i=st , j=dr; while (1){ while (v[i]<pivot) i++; while (v[j]>pivot) j--; if (i>=j) return j; swap(v[i],v[j]); i++; j--; }}

Partitia Hoare

int partition_Lomuto(int* v, int st, int dr){ int poz_pivot = alege_poz_pivot(v,st,dr); swap(v[poz_pivot],v[dr]); int i=st-1; for (int j=st;j<dr;j++){ if (v[j]<v[dr]) swap(v[++i],v[j]); } swap(v[i+1],v[dr]); return i+1;}

Partitia Lomuto

Google Sites

Report abuse