Question

an urn containing n balls can be represented by the set u = {b1, b2, ... , bn}. interpret the following algorithm in the context of urn problems. does it represent drawing with or without replacement? how many lines does it print? for i is in {1, 2, ... , n} do for j is in {1, 2, ... , n} do for k is in {1, 2, ... , n} do print bi, bj, bk

Answer 1

The algorithm prints out all the possible ways to draw 3 balls in sequence, ---Select--- with replacement. It prints lines.