Mox1to/Knapsack-Problem Mox1to/Knapsack-Problem

  • Stars
    star
    1
  • Language
  • Created over 4 years ago
  • Updated over 4 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
Mox1to/Knapsack-Problem
github

Mox1to

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

πŸ“ŽπŸ’Ό The backpack problem - given N items, and the item has a mass w> 0 and a cost pi> 0. It is required that the total mass does not exceed a given value W (backpack capacity), and the total cost is maximum. C++

More Repositories

1

Site_profile

🌎 Making my portfolio website using html, css, bootstrap, javascript. It is my first global web project.
HTML
1
star
2

Bar_Chart

πŸ“Š Create a screen application that displays a bar chart with a random number of columns, with a random height, and color, as well as writing their number and characteristics to a file with the ability to read data from the file.
1
star
3

Word_search_sorting

πŸ“ƒ | 1. The number of phrases is set 2. A dynamic two-dimensional array of characters is created. 3. The word is set 4. Select phrases containing the given word and rewrite them in another array, deleting from the original one. Implement a separate function. 5. Both arrays are sorted by user choice: 1) Alphabetically 2) The length of the phrase
1
star
4

WinForms_task_1

πŸ“œEnter five different numbers in RichTextBox1, separated by spaces. Multiply each of these numbers by 2 and print in RichTextBox2, each in a new line with the result header.
C#
1
star