xpt1 Posted February 26, 2011 Report Share Posted February 26, 2011 Buna ziua!Astazi dimineata am aflat ca nu trebuie sa-mi bat capul sa retin ditamai algoritmii wuicksort, mergesort, bublesort, etc.Daca doriti sa vedeti toti algoritmii, ii puteti gasii aici. Quote Link to comment Share on other sites More sharing options...
against_modern_football Posted February 26, 2011 Report Share Posted February 26, 2011 nu trebuie sa-i retii )trebuie sa stii sa ii scrii din cap Quote Link to comment Share on other sites More sharing options...
immun3 Posted February 26, 2011 Report Share Posted February 26, 2011 buble sort e chiar usor , si restu sunt la fel, unde este problema? trebuie sa gandesti putin, asta e tot Quote Link to comment Share on other sites More sharing options...
l3asketballplayer Posted February 26, 2011 Report Share Posted February 26, 2011 Trebuie doar sa stii stl. In general stl iti ofera alternative optimizate la maxim pt. maj algoritmilor si structurilor de date. O greseala: functia qsort nu e din stl ci e din stdlib, o poti folosi si in c nu doar in c++. ditamai algoritmii wuicksort, mergesort, bublesort, etc.Daca astia is ditamai algoritmi . Eu zic ca ar fi trebuit mentionat si random qsort Quote Link to comment Share on other sites More sharing options...
xpt1 Posted February 26, 2011 Author Report Share Posted February 26, 2011 Si de ce nu il mentionam.Nu la asta ma refer, ci la faptul ca la oli am pierdut timp (pretios; vre-o 15 minute de debuging) fiindca uitasem quick-ul...Cat despre stl... vre-un tutorial, ceva? Quote Link to comment Share on other sites More sharing options...
l3asketballplayer Posted February 27, 2011 Report Share Posted February 27, 2011 vezi pe cplusplus.com Daca ai intrebari intreaba-ma si incerc sa te ajut . Daca nu stii quick faci o sortare in n^2 ca la oli merge orice Quote Link to comment Share on other sites More sharing options...
