satr algoritmlari

PDF 80 pages 3.4 MB Free download

80 pages

FaylHub.uz

Download via Telegram

Size 3.4 MB

File type PDF

Pages 80

Updated Dec 2025

Page preview (5 pages)

Scroll down 👇

1 / 80

satr algoritmlari. satr algoritmlari. satr masalalarini orientrlangan graf masalalariga olib kelish. string? • bizga summa o’zgaruvchisi berilgan. u o’zida barcha alfavitlar to’plamini saqlasin. ∑=(a,b,c, … , x,w,z). – a qatori ∑* ning istalgan elementi hisoblanib, ushbu ∑ ning 0 yoki undan ortiq elementlaridan iborat har qanday ketma-ketlikdir. – ‘bu satr tipidagi ma’lumot’ ∈ ∑* – ‘shuningdek bu ham satr’ ∈ ∑* – ‘1234’ ∉ ∑* think’s!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! string operatorlari • bizga s1 va s2 satrlar berilgan bo’lsin. mos ravishda uzunliklari n va m bo’lsin. • tenglik: s1=s2? o’rinlimi? (mumkin bo’lgan holatlarni ko’ramiz) – ‘bu satr tipidagi ma’lumot’ = ‘bu satr tipidagi ma’lumot’ – ‘bu satr tipidagi ma’lumot’ ≠ ‘bu boshqa tipdagi ma’lumot’ – ‘bu satr tipidagi ma’lumot’ =? ‘bu satr tipidagi ma’lumot’ • ishlash vaqti • n eng qisqa matn uzunligi bo’lsa: o(n) string operatorlari •s1s2 stringlarni o’zaro birlashtiramiz. –‘bu’,’satr’ → ‘bu satr’ •ishlash vaqti (yangi string hosil qilamiz deb hisoblang) …

2 / 80

8) → ‘s is’ • ishlash vaqti –ө(j-i+1) •prefiks: prefix(s,i) = substring(s, 1, i) •suffiks: suffix(s,i) = substring(s, i+1, length(n)) masofa(levenshtein masofasi)ni tahrirlash • ikki satr orasidagi masofani o’lchash s1 satrni s2 satrga o’zgartirish uchun zarur bo'lgan qo'shimchalar, o’chirish ishlari va almashtirishlarning eng kam sonidir. • joylashtirish: misol: misol: misol: misol: masofani oʻnglash •nima uchun bu foydali bo'lishi mumkin? tahrir masofasi simmetrikmi? •ya’ni edit(s1,s2) = edit(s2,s1) ? –edit(simple, apple) =? edit(apple,simple) •nima uchun? –sub ‘i’ , ‘j’ ga → sub ‘j’ , ‘i’ ga –delete ‘i’ → insert ‘i’ ga –insert ‘i’ → delete ‘i’ ga mos amal hisoblanadi tahrirlash masofasini hisoblash g’oyalar? tahrirlash masofasini hisoblash barcha mumkin bo’lgan operatsiyalardan so'ng x ni y bilan tenglashtirish kerak insert insert delete delete substitution substitution konbinatsiya natijasi: kombinatsiya natijasi running time satrli moslik • uzunligi m ning namuna string p va s uzunlikdagi n qatorini hisobga olsak, p ning s da sodir …

3 / 80

4 / 80

5 / 80

Want to read more?

Download all 80 pages for free via Telegram.

Download full file

About "satr algoritmlari"

satr algoritmlari. satr algoritmlari. satr masalalarini orientrlangan graf masalalariga olib kelish. string? • bizga summa o’zgaruvchisi berilgan. u o’zida barcha alfavitlar to’plamini saqlasin. ∑=(a,b,c, … , x,w,z). – a qatori ∑* ning istalgan elementi hisoblanib, ushbu ∑ ning 0 yoki undan ortiq elementlaridan iborat har qanday ketma-ketlikdir. – ‘bu satr tipidagi ma’lumot’ ∈ ∑* – ‘shuningdek bu ham satr’ ∈ ∑* – ‘1234’ ∉ ∑* think’s!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! string operatorlari • bizga s1 va s2 satrlar berilgan bo’lsin. mos ravishda uzunliklari n va m bo’lsin. • tenglik: s1=s2? o’rinlimi? (mumkin bo’lgan holatlarni ko’ramiz) – ‘bu sat...

This file contains 80 pages in PDF format (3.4 MB). To download "satr algoritmlari", click the Telegram button on the left.

Tags: satr algoritmlari PDF 80 pages Free download Telegram