From professional translators, enterprises, web pages and freely available translation repositories.
sort algorithm
сортиращ алгоритъм
Last Update: 2006-09-06
Usage Frequency: 1
Quality:
algorithm
алгоритъм
Last Update: 2014-11-21
Usage Frequency: 2
Quality:
algorithm:
Алгоритъм:
Last Update: 2011-10-23
Usage Frequency: 2
Quality:
hash algorithm
хеширащ алгоритъм
Last Update: 2006-09-06
Usage Frequency: 1
Quality:
sort
Вид
Last Update: 2014-11-21
Usage Frequency: 3
Quality:
signature algorithm
Сигнатурен алгоритъм
Last Update: 2014-11-08
Usage Frequency: 1
Quality:
sort list
Сортирай Листа
Last Update: 2012-03-22
Usage Frequency: 1
Quality:
& undo sort
& Отмяна на изтриването
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
secure hash algorithm
защитен хешов алгоритъм
Last Update: 2006-09-06
Usage Frequency: 1
Quality:
& sort albums
& Подреждане на албумите
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
unknown signature algorithm
Неизвестен алгоритъм на подпис
Last Update: 2013-02-08
Usage Frequency: 2
Quality:
working wall-bouncing algorithm
working wall- bouncing algorithm
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
ascending clock auction algorithm
Алгоритъм на търга с явно наддаване и периодично повишение на тръжната цена
Last Update: 2014-11-21
Usage Frequency: 1
Quality:
uniform-price auction algorithm
Алгоритъм на търга с еднаква цена
Last Update: 2014-11-21
Usage Frequency: 1
Quality:
algorithm 4 supports settlement procedure 5.
Алгоритъм 4 поддържа процедура за сетълмент 5.
Last Update: 2014-11-21
Usage Frequency: 1
Quality:
color, stefan-singer algorithm, rgb
color, stefan- singer algorithm, rgb
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
selection sort is noted for its simplicity, and also has performance advantages over more complicated algorithms in certain situations.
Сортирането чрез пряка селекция впечатлява с простотата си, а също така в дадени ситуации има предимства пред някои сложни алгоритми.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
as they show, this modification can allow the algorithm to sort more quickly than o("n" log "n") for inputs that are already nearly sorted.
* levcopoulos and petersson describe a variation of heapsort based on a cartesian tree that does not add an element to the heap until smaller values on both sides of it have already been included in the sorted output.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting