by db creid - HWzone Forums
Skip to content
  • Create an account

by db creid

registered user
  • Number of messages

  • Join

  • Recently visited

  • Days Won


by db creid last won the day on January 11, 2021

by db creid had the most liked content!

Recent Visitors

490 Profile Views

The ratings of af db creid

Zone Freak

Zone Freak (3/6)



  1. If the "base" is the primitive types, then yes, it still has the String and int and long. If the "base" is how to write code, then I'm sorry, but if you write in a job interview code with for for lo of C and new Runnable instead of lambda, then how to say, Leah I would get to work. The world has changed (even Java). Not to mention the ecosystem.
  2. I do not know the books, but my recommendation: do not learn numbers in Hebrew, and if you can, do not learn numbers at all. They tend to age very quickly.
  3. Go over the Microsoft article at Write C ++ extensions for Python - Visual Studio | Microsoft Docs.
  4. The simplest way is to communicate using stdin and stdout. But if you really want to, you can embed CPython in your application.
  5. And that's great for Nvidia. Both public relations and more money, which is better?
  6. IBM Creates First 2nm Chip (
  7. First of all, the code will not work with some linked lists of different lengths. Second, a bit more idiomatic code would look this way: public static > List combineSorted (LinkedList ... lists) {List newList = new LinkedList (); for (LinkedList list: lists) {newList.addAll (list); } Collections.sort (newList); return newList; } But the simplest code is with the Java 8 Streams API: public static > List combineSorted (LinkedList ... lists) {return (lists) .flatMap (List :: stream) .sorted () .collect (Collectors.toList ()); } And as for the complications: we add each list to the final list. K lists, each N members - total KN. Besides, we sort this list. Collections.sort () copies the list to an array (O (len)), then sorts it in TimSort (which is O (len * log () len))), and finally copies back to the list (again O (len)). Our len is K * N, so the total complexity is: O (K * N + K * N + K * N * log (K * N ) + K * N) = O (K * N * log (K * N))
  8. Yes but you copy it in fullName (), so you need to allocate enough memory. What is the error that appears?
  9. A. There's a button in the toolbar for the code, thanks. B. len () does not take into account the middle length. third. Does the file exist in the folder from which you are running the program? What is its content?
  10. And how long will it take for them to move to 2?
  11. What did you try? Where are you stuck?
  12. It is also recommended to attach a code, and try to clarify a little more.
  • Create new ...

At the top of the news:

new on the site