Is the single linked list already sorted, so identical elements are adjacent?
If its an sorted array that makes it easy.
But my question is incase of Unsorted array.
I know one method is liner search method. Where each indivual element is check once with all elements. But the complexity is O(n*n)
Basically, you use the hash to answer the "doesElementExist" test. If it doesn't, copy it to the unique list.
Or you could just insert the whole list into a balanced binary tree, then flatten it into a list when you're done. The inserts will be O(log2(n)) on average, either finding the item already present or finding where to insert it.
Hi. I have a form with list box : lst_product, datagridview : grd_order and button: btn_addline. lst_product has a list of product ids selected from database (MS Acess 2013) , grd_order is by default empty except for 2 headers and btn_addline adds rows to grd_order.
Hi, as I was told that my code doesn’t scale well at all, I thought perhaps I’d try to get a better understanding of interfaces/abstract classes and classes and the relationship between them.
I don’t want at this stage work on a big separate project as I've already got plenty ...
I am writing a java program that needs to execute shell commands, so I wrote a function that would take the command to execute as a string (ie: "mkdir ~/Folder1") and execute that command with the shell. Here is the function:
Runtime run = Runtime.getRuntime();
Process pr = ...