| 000 | 01792 am a2200433 i 4500 | ||
|---|---|---|---|
| 001 | 6690 | ||
| 003 | BAUN | ||
| 005 | 20250326100750.0 | ||
| 008 | 811016t19821982njua b 001 0 eng | ||
| 020 |
_a0134340019 _q(pbk.) |
||
| 020 |
_a9780134340012 _q(pbk.) |
||
| 020 | _a0134339959 | ||
| 020 | _a9780134339955 | ||
| 035 |
_a(OCoLC)7924791 _z(OCoLC)877041737 |
||
| 040 |
_aDLC _beng _cDLC _dFNU _dAUT _dMUQ _dYBM _dBAKER _dNLGGC _dBTCTA _dYDXCP _dOCLCG _dNLE _dDEBBG _dBDX _dOCLCF _dOCLCO _dCQ$ _dOCLCQ _dUtOrBLW _dBAUN _erda |
||
| 041 | 0 | _aeng | |
| 049 | _aBAUN_MERKEZ | ||
| 050 | 0 | 4 |
_aQA76.95 _bD76 1982 |
| 082 | 0 | 0 | _219 |
| 100 | 1 |
_aDromey, R. G., _d1946- _986605 _eaut |
|
| 245 | 1 | 0 |
_aHow to solve it by computer / _cby R.G. Dromey |
| 264 | 1 |
_aEnglewood Cliffs, N.J. : _bPrentice-Hall International, _c[1982] |
|
| 264 | 4 | _c©1982 | |
| 300 |
_axxi, 442 pages : _billustrations ; _c23 cm |
||
| 336 |
_2rdacontent _atext _btxt |
||
| 337 |
_2rdamedia _aunmediated _bn |
||
| 338 |
_2rdacarrier _avolume _bnc |
||
| 490 | 1 | _aPrentice-Hall International series in computer science | |
| 504 | _aIncludes bibliographical references and index | ||
| 505 | 0 | 0 |
_tIntroduction to computer problem-solving _t-- Fundamental algorithms _t-- Factoring methods _t-- Array techniques _t-- Merging, sorting and searching _t-- Text processing and pattern searching _t-- Dynamic data structure algorithms _t-- Recursive algorithms |
| 650 | 0 |
_aMathematics _xData processing _91915 |
|
| 650 | 0 |
_aProblem solving _xData processing _9103300 |
|
| 650 | 0 |
_aComputer programming _93152 |
|
| 650 | 4 |
_aMathématiques _xInformatique |
|
| 650 | 4 | _aProgrammation (Informatique) | |
| 650 | 4 |
_aRésolution de problème _xInformatique |
|
| 830 | 0 |
_9108660 _aPrentice-Hall international series in computer science. |
|
| 942 |
_2lcc _cKT |
||
| 999 |
_c5476 _d5476 |
||