Closed VinhDevNguyen closed 4 years ago
https://github.com/dxv2k/CS112.L12.KHCL/blob/ec28de4e35e4c8ebd14d09d6c78050e9f4b27327/Week1/BOT/solution.py#L1-L18
Đoạn code này ông @dxv2k đã tính đến trường hợp nếu có nhiều cách chọn thì chỉ ra cách chọn có p
nhỏ nhất như đề bài đã ghi chưa?
Checkout and compare my solution with @dxv2k solution!
In algorithm design, must use pseudo-code
Ok, I will add it into Jupiter notebook version a.s.a.p
I created Jupiter Noteboook version, @Dokkaebi00 will take care of the code and I will review it later. If every thing OK. Merge your branch into master
branch.
Please do this a.s.a.p cause deadline is Due Sep 18
Missing desciption of Temporary variable
, Condition
and Description
of algorithm (Write psudo code in description
)
@Dokkaebi00 Please add these in Jupiter Notebook file a.s.a.p
@dxv2k Review this file and the JupiterNotebook version of BOT exercise before we merge BOT_Quang_solution
branch into master
branch.
Done!
Review BOT exercise!
If there are any problem, please comment below. If not, tick 'x' on 1.1. BOT (Built-Operation-Transfer), close commit and merge branch
BOT_Vu_solution
tomaster