Python Weighted Random [duplicate]

Your algorithm is correct, how about something more elegant:

import random
my_list = ['A'] * 5 + ['B'] * 5 + ['C'] * 90
random.choice(my_list)

Related Posts:

  1. Quicksort with Python
  2. Python: maximum recursion depth exceeded while calling a Python object
  3. Modular multiplicative inverse function in Python
  4. In a triangulated isometric grid, what triangle is a given point in?
  5. What is a loop invariant?
  6. What is a loop invariant?
  7. What does O(log n) mean exactly?
  8. Dijkstra’s algorithm in python
  9. how to calculate binary search complexity
  10. Dijkstra’s algorithm in python
  11. When is it practical to use Depth-First Search (DFS) vs Breadth-First Search (BFS)? [closed]
  12. Removing duplicates in lists
  13. What does O(log n) mean exactly?
  14. What is Sliding Window Algorithm? Examples?
  15. How to generate all permutations of a list?
  16. What is the difference between tree depth and height?
  17. how to implement quick sort algorithm in C++
  18. Python: maximum recursion depth exceeded while calling a Python object
  19. Why is the time complexity of both DFS and BFS O( V + E )
  20. Time complexity of a Priority Queue in C++
  21. What is stability in sorting algorithms and why is it important?
  22. Breadth First Search time complexity analysis
  23. Counting the sum of every nodes’ neighbors’ degrees?
  24. Time Complexity of the Kruskal Algorithm?
  25. Quick Sort Vs Merge Sort
  26. Polynomial time and exponential time
  27. Insertion Sort vs. Selection Sort
  28. Difference and advantages between dijkstra & A star
  29. Best Case for Bubble Sort
  30. How to find the kth smallest element in the union of two sorted arrays?
  31. Big O, how do you calculate/approximate it?
  32. Performing Breadth First Search recursively
  33. Is Quicksort in-place or not?
  34. Find how many connected groups of nodes in a given adjacency matrix
  35. Python: maximum recursion depth exceeded while calling a Python object
  36. longest increasing subsequence(O(nlogn))
  37. O(n log n) vs O(n) — practical differences in time complexity
  38. When should I use Kruskal as opposed to Prim (and vice versa)?
  39. Trying to understand max heapify
  40. Shortest possible depth of a leaf in decision tree (comparison sorting algorithm)
  41. What is the meaning of “exclusive” and “inclusive” when describing number ranges?
  42. What’s a good algorithm to generate a maze?
  43. Intuition for perceptron weight update rule
  44. Easy: Solve T(n)=T(n-1)+n by Iteration Method
  45. What is tail call optimization?
  46. PacMan: what kinds of heuristics are mainly used?
  47. Quicksort vs heapsort
  48. Big-oh vs big-theta
  49. Best case time complexity for selection sort
  50. Looking for algorithm finding euler path
  51. Trie complexity and searching
  52. What does this definition of contiguous subsequences mean?
  53. Is log(n!) = Θ(n·log(n))?
  54. Is complexity O(log(n)) equivalent to O(sqrt(n))?
  55. How to find maximum spanning tree?
  56. Algorithm for solving Sudoku
  57. Exactly how many comparisons does merge sort make?
  58. Algorithm to return all combinations of k elements from n
  59. How to calculate big-theta
  60. What is the time complexity of while loops?
  61. Merge sort time and space complexity
  62. Intuitive explanation for why QuickSort is n log n?
  63. Calculate distance between two latitude-longitude points? (Haversine formula)
  64. Shuffle a deck of cards in Java
  65. How to calculate time complexity of backtracking algorithm?
  66. What is a loop invariant?
  67. Hash table runtime complexity (insert, search and delete)
  68. Which is better: O(n log n) or O(n^2)
  69. What is O(log* N)?
  70. Quickselect time complexity explained
  71. Edit Distance in Python
  72. What is the proper equivalent of “while(true)” in plain C?
  73. Bellman-Ford vs Dijkstra: Under what circumstances is Bellman-Ford better?
  74. Asymptotic Notation – does n (log n) (log n) simplify?
  75. Difference between Big-O and Little-O Notation
  76. What is the big-O of the function (log n)^k
  77. How to calculate an angle from three points?
  78. Why is O(n) better than O( nlog(n) )?
  79. How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)
  80. Is there an O(n) integer sorting algorithm?
  81. An example of Best Case Scenario for Quick Sort (Need someone to check if my answer is correct)
  82. how to write a recurrence relation for a given piece of code
  83. Why is merge sort worst case run time O (n log n)?
  84. Why is merge sort worst case run time O (n log n)?
  85. Rolling or sliding window iterator?
  86. What is the time and space complexity of a breadth first and depth first tree traversal?
  87. Create your own MD5 collisions
  88. Image Segmentation using Mean Shift explained
  89. Finding the median of an unsorted array
  90. Python Brute Force algorithm
  91. Difference between Big-Theta and Big O notation in simple language
  92. What is the difference between bucket sort and radix sort?
  93. How are the following functions O(N^3)?
  94. Difference between O(n) and O(log(n)) – which is better and what exactly is O(log(n))?
  95. Are there any real O(n^n) algorithms?
  96. Sorting an array in C?
  97. Is Dijkstra’s algorithm for directed or undirected graphs?
  98. How to determine if a point is in a 2D triangle?
  99. Minesweeper solving algorithm
  100. About bubble sort vs merge sort

Leave a Comment