Question: Rewrite this line of code without using a sequence assignment. self.ca

Question

Question:
Rewrite this line of code without using a sequence assignment.
self.cards[i], self.cards[j] = self.cards[j], self.cards[i]
--
The reading for the above question is posted below.
---
Shuffling the deck: If a deck is perfectly shuffled, then any card is equally likely to appear anywhere
in the deck, and any location in the deck is equally likely to contain any card. To shuffle the deck, we will use the randrange function from the random module.
With two integer arguments, a and b, randrange chooses a random integer in
the range a <= x < b. Since the upper bound is strictly less than b, we can use
the length of a list as the second argument, and we are guaranteed to get a legal
index. For example, this expression chooses the index of a random card in a deck: random.randrange(0, len(self.cards)) An easy way to shuffle the deck is by traversing the cards and swapping each card
with a randomly chosen one. It is possible that the card will be swapped with
itself, but that is fine. In fact, if we precluded that possibility, the order of the
cards would be less than entirely random: class Deck:
   ...
   def shuffle(self):
      import random
      nCards = len(self.cards)
      for i in range(nCards):
         j = random.randrange(i, nCards)
   self.cards[i], self.cards[j] = self.cards[j], self.cards[i] Rather than assume that there are fifty-two cards in the deck, we get the actual
length of the list and store it in nCards. For each card in the deck, we choose a random card from among the cards that
haven’t been shuffled yet. Then we swap the current card (i) with the selected
card (j). To swap the cards we use a tuple assignment, as in Section 9.2: self.cards[i], self.cards[j] = self.cards[j], self.cards[i] Shuffling the deck: in the deck, and any location in the deck is equally likely to contain any card. index. For example, this expression chooses the index of a random card in a deck: random.randrange(0, len(self.cards)) cards would be less than entirely random:    self.cards[i], self.cards[j] = self.cards[j], self.cards[i] length of the list and store it in nCards. card (j). To swap the cards we use a tuple assignment, as in Section 9.2:

Explanation / Answer

Hi, self.cards[i] = self.cards[i] + self.cards[j] self.cards[j] = self.cards[i] - self.cards[j] self.cards[i] = self.cards[i] - self.cards[j] Please use above three statements. self.cards[i] and self.cards[j] will be swapped. Regards A

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.