Lompat ke isi

Modul:Exponential search/doc: Riwayât rèvisi

Pèlè ḍuwâ' tora (bârna bhiru tasè' è bâbâ) terros pècè' "bhânḍhingngaghi" mon abhânḍhingngaghina vèrsi sè èkaterrowè. Klik sèttong tangghâl mon nèngguwâ vèrsi kaca è tangghâl kasebbhut.
Panegghes: (satèya) = bhidhâ jângkènè, (sabelluna) = bhidhâ bi' vèrsi sabelluna, k = beccè'an kènè'.

3 Oktober 2024

  • satèyasabelluna 03.143 Oktober 2024 03.14 Munajad.MH kanḍhâ dhurrun 4.013 bita +4.013 ←Membuat halaman berisi '{{high use}} This module provides a generic exponential search algorithm. This kind of search can be useful when you want to find a key in some kind of sorted array, and you want to do it by checking as few array elements as possible. This could include situations like: * Finding the highest archive number in a set of archives without checking whether they all exist. * Finding the number of positional arguments in frame.args without having to expand the wikit...'
Èpondhut ḍâri "https://mad.wikipedia.org/wiki/Modul:Exponential_search/doc"