43 C Program to Solve Knapsack Problem using Dynamic Programming

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

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

  • @shrivatsaks
    @shrivatsaks 6 месяцев назад +2

    Sir can you please send notes for analysis and design algorithm for studying for vtu?? you can upload to google drive and send link here sir btw u r very good teacher thank you sir

  • @kawshika3463
    @kawshika3463 6 месяцев назад +2

    Nice

  • @yadav211
    @yadav211 5 месяцев назад

    Sir give me the link of the notes sir 🙏

  • @vinayaksharma914
    @vinayaksharma914 9 месяцев назад

    sir can you send me your code ?

    • @datastructuresalgorithmsby7411
      @datastructuresalgorithmsby7411  9 месяцев назад +8

      #include
      int max(int a,int b)
      {
      if(a>b)
      return a;
      else return b;
      }
      int main()
      {
      int n,M,i,j,w[10],p[10],v[10][10],x[10]={0};
      printf("
      Read the number of objects :");
      scanf("%d",&n);
      printf("
      enter the weights of objects
      ");
      for(i=1;i

    • @vinayaksharma914
      @vinayaksharma914 9 месяцев назад

      @@datastructuresalgorithmsby7411 Thanks sir!