Part 18 - Brute Force String Matching Algorithm

Поделиться
HTML-код
  • Опубликовано: 13 янв 2025

Комментарии • 4

  • @VinodKumar-ko8se
    @VinodKumar-ko8se 9 месяцев назад +1

    Thank you sir

  • @DhanalakshmiS-uu2rq
    @DhanalakshmiS-uu2rq 7 месяцев назад

    Great explanation sir, thank you for teaching

  • @visiblegamerff3875
    @visiblegamerff3875 6 месяцев назад

    Sir I have a doubt if we needed to find all 3 cases
    Is that like
    Big-oh=worst case only
    Theta=avg case only
    Big omega = best case only
    ,I think it's not like this na
    "A single symbol can represent any of the cases"

    • @DrMadhusudhan_Mandya_Venkatesh
      @DrMadhusudhan_Mandya_Venkatesh  6 месяцев назад

      @@visiblegamerff3875 no, there is no single notation to represent all 3 cases.....since they are of different cases, different symbols