아무거나적어~
-
-
-
upper_bound of binomail coefficients아무거나적어~ 2023. 12. 21. 18:15
Proof for the upper bound and lower bound for binomial coefficients. I have seen the bounds $\left(\frac{n}{k}\right)^k \leq {n \choose k} \leq \left( \frac{en}{k}\right)^k$ for integers $n \geq k >0$ for the binomial coefficient. I can prove the upper bound in t... math.stackexchange.com
-
Declare Comparator For Set of Pair in C++아무거나적어~ 2023. 12. 7. 20:36
How to Declare Comparator For Set of Pair in C++? - GeeksforGeeks A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions. www.geeksforgeeks.org
-
c++ 에서 +는 매번 string을 복사하는 연산이 아님(python과 다름)아무거나적어~ 2023. 12. 5. 10:34
String concatenation complexity in C++ and Java Consider this piece of code: public String joinWords(String[] words) { String sentence = ""; for(String w : words) { sentence = sentence + w; } return sentence; } On each stackoverflow.com Time complexity of string concatenation in Python I'm analysing the complexity of my code. From what I found online, since strings are immutable in python, a con..