Remove duplicates from an array

Assignment Help Basic Computer Science

Reference no: EM131243305

Here's an interesting way to remove duplicates from an array. The insertion sort uses a loop-within-a-loop algorithm that compares every item in the array with every other item. If you want to remove duplicates, this is one way to start. (See also Exercise 2.6 in Chapter 2.) Modify the insertionSort() method in the insertSort.java program so that it removes duplicates as it sorts. Here's one approach: When a duplicate is found, write over one of the duplicated items with a key value less than any normally used (such as -1, if all the normal keys are positive). Then the normal insertion sort algorithm, treating this new key like any other item, will put it at index 0. From now on the algorithm can ignore this item. The next duplicate will go at index 1, and so on. When the sort is finished, all the removed dups (now represented by -1 values) will be found at the beginning of the array. The array can then be resized and shifted down so it starts at 0.

Reference no: EM131243305

Questions Cloud

What is the downward closure property : What is the downward closure property? How does it aid in developing an efficient algorithm for finding association rules, Le., with regard to finding large itemsets?

Prepare next years financial plan and operational budget : Your Key Assignment Draft is designed to help you prepare for the presentation in Phase 5. The chief executive officer (CEO) of Krona has asked that you Prepare next year's financial plan and operational budget.

How many people were included in analysis : Determine whether a physical rehabilitation treatment reduces the amount of pain among patients who are suffering from lower back pain - How many people were included in this analysis?

Compute the beta of given stock markets : Compute the beta of these stock markets with respect to the S&P 500 market index. What do your market betas suggest about the diversification benefits of these markets?

Remove duplicates from an array : Here's an interesting way to remove duplicates from an array. The insertion sort uses a loop-within-a-loop algorithm that compares every item in the array with every other item.

Why can''t priority queue wrap around like an ordinary queue : Think about how you remember the events in your life. Are there times when they seem to be stored in your brain in a stack? In a queue? In a priority queue?

Create a policy for employee use of technology : For the employee handbook, create a policy for employee use of technology because new sources of social media and more advanced electronic devices are regularly being introduced to the market.

Compare and contrast to your chosen change model : For this assignment, write a 1-2 page analysis of the change methods that were implemented to address the organization's problems. Compare and contrast to your chosen change model. Include an example of at least three similarities and three differ..

How the group of four items crawls up to the top of queue : Start with the initial configuration of the Queue Workshop applet. Alternately remove and insert items. (This way, you can reuse the deleted key value for the new item without typing it.) Notice how the group of four items crawls up to the top of ..

User Account

All Pages