lina12 - HWzone Forums
adplus-dvertising
Skip to content
  • Create an account

lina12

registered user
  • Number of messages

    15
  • joining

  • Recently visited

Recent Visitors

Visitors to your profile are disabled, and you can not see who recently visited your profile.

The ratings of lina12

Zone Newbie

Newbie Zone (1/6)

0

Rating

  1. Given an exercise that all the lists that the method receives are of the same length (N). My question is whether or not one should address the fact that it is linked lists and create a class of Node and such.
  2. Hi, I need to implement a method that accepts linked lists (of a generic type) and returns a sorted list. public static > List combineSorted (LinkedList ... lists) {int listsLength = lists.length; // number of lists int length = lists [0] .size (); // elements on each list List newList = new LinkedList (); for (int i = 0; i <listsLength; i ++) {for (int j = 0; j <length; j ++) {newList.add (lists [i] .get (j)); }} Collections.sort (newList); return newList; The code works but I would love help with calculating the complexity (there are k linked lists and each of the lists is N length). And if there is an idea for someone to code with better complexity I would love to hear as well. Thank you!
  3. Thank you very much first of all! In a dynamic assignment I check if the assignment was successful and if not I return an error message and exit the program. Before exiting the program do I still need to release the allocated memory even though the allocation failed?
  4. Hi, I'd love to help you figure out how to allocate a two-dimensional charger. Note that the number of rows is equal to the number of columns. Thank you
  5. Hi, I'd love to help you figure out how to allocate a two-dimensional charger. Note that the number of rows is equal to the number of columns. Thank you
  6. Hi I need to convert a number I get and put it in a string. I need to write the path in a function and can not use functions for example itoa etc. Plus, I did not learn sprintf anymore so it is not possible to use it either. Would appreciate help. Thank you!
  7. With scanf does not work for me. It is not possible to receive spaces with scanf
  8. Hi I need to pick up a string in C that can also contain spaces. When I do this in scanf it stops the reception after the gain. I would love to know how it is possible for the string to absorb profits as well. Just note that we did not learn the get function for reception (we only learned scanf and getchar). Thank you!
  9. I got an array for the function. I calculated the function in the 0th limb and each time I advanced the array by 1 (i.e. array + 1) and put a print command at the end.
  10. Should be done with arrays. By and large I was able to do it without an array. But when I tried to turn it into an array everything got confused there. And the thing with the letters I know how to do I just can not arrange it so that it will run properly.
  11. True, but I need to print out only the characters that are letters from the array.
  12. I need to pick up the characters first, then activate the function and change their order and only pick up the letters without the numbers and characters that can be in the array. Mostly it is not clear to me what is done within the function with the array. How do you print and how do you receive?
  13. Need to pick up text from the main and then run the function. By and large I was able to do it without an array. The problem is that there is a limit to 100 characters so I'm pretty sure the only way is in the array.
  14. Hello, I'm already really desperate so I'd love to help with the question (C language). I need to write a recursive function (without pointers) that takes a string into an array (up to 100 characters) and prints it in reverse order and only the letters without the characters. Thank you!
×
  • Create new ...

At the top of the news:

new on the site