Iyini ingozi ye-algorithm engenalutho yesampuli elula engahleliwe?
Context:Kuye kwasungulwa ama-algorithm amaningana asebenzayo okwenza isampuli elula engahleliwe. I-algorithm engenangqondo i-algorithm yokudweba lapho esinyathelweni ngasinye sisusa into esinyathelweni esinjalo kusuka kusethi ngokunokwenzeka okulinganayo bese sifaka into kusampula. Siyaqhubeka kuze kube sithola isampula usayizi oyifunayo  k. noma Okubi ngale ndlela ukuthi idinga ukufinyelela okungahleliwe kusethi.  I-algorithm yokukhetha-ukwenqaba eyenziwe nguFan et al. ngo-1962 idinga ukudluliswa kwedatha okukodwa; kodwa-ke, iyi-algorithm elandelanayo futhi idinga ulwazi ngenani eliphelele lezinto  n, okungatholakali ezimweni zokusakaza.  I-algorithm elula kakhulu yokuhlunga okungahleliwe yafakazelwa uSunter ngo-1977. I-algorithm imane inikeze inombolo engahleliwe edonswe ekwabelaneni okufana (Umthetho 0 Izinketho , 1 1 ) Izindawo (0,1) njengoba isihluthulelo into ngayinye, bese uhlela zonke izinto usebenzisa ukhiye bese ukhetha ezincane  k izinto.  J. Vitter ngo-1985 wasikisela ama-algorithm okusampula amachibi, asetshenziswa kabanzi. Lokhu algorithm akudingi ulwazi ubukhulu labantu  n kusengaphambili, futhi isebenzisa isikhala esingaguquki.  Ukuthatha amasampula ngengozi kungasheshiswa nangokuthatha amasampula ngokwabiwa kwezikhala phakathi kwamasampula bese kudedelwa izikhala.
Okubi ngale ndlela ukuthi idinga ukufinyelela okungahleliwe kusethi.