Javascript Array method of weight (four) detailed and example code _JAVASCRIPT skills

Four ways to go heavy with Javascript arrays

Four algorithms to achieve this goal:

The first method:

Array.prototype.unique1 = function () {
 var n = [];//A new temporary array for
 (var i = 0; i < this.length; i++)//traverse the current array 
   {
  //If Part I of the current array has been saved in a temporary array, skip,
  //or push the current item to the temporary array if
  (N.indexof (this[i) = = 1) n.push (this[i));
 } return
 N;
}

The second method:

Array.prototype.unique2 = function ()
{
 var n = {},r=[];//n is a hash table, r is a temporary array for
 (var i = 0; i < this.length; i++)//traverse the current array
 {if
 (!n[this[i]])//If there is no current item
 {N[this[i] in the hash table
  = true;//deposit Hash Table
  R.push (this [i]); Push the current item of the current array into the temporary array
 } return
 r;
}
var arr = [1, ' A ', ' a ', ' B ', ' d ', ' e ', ' e ', 1, 0]
alert (arr.unique2 ());

The third method:

Array.prototype.unique3 = function ()
{
 var n = [this[0]];//result array for
 (var i = 1; i < this.length; i++)//from second Entry begins traversal
 {
 //If the first occurrence of the current array in the current array is not I,//it
 means that item I is duplicated and ignored. Otherwise deposit the result array
 if (This.indexof (this[i]) = = i) N.push (This[i]);
 }
 return n;
}

Both the 1th and 3rd methods use the IndexOf method of the array. The purpose of this method is to find the position where the parameter is stored for the first time in the array. It is obvious that the JS engine will iterate through the array when it implements this method until it finds the target. So this function will waste a lot of time. The 2nd method uses a hash table. To deposit an object in a form that has already appeared through the subscript. The subscript reference is much faster than searching the array with indexof.

To determine the efficiency of these three methods, I did a test program that generated an array of 10000-length random numbers, and then tested the execution time in several ways. The results show that the second method is much faster than the other two methods. But memory footprint should be more than the second method, because there is more than one hash table.  This is called space exchange time. This is the test page, you can also go to see.

The fourth method:

Array.prototype.unique4 = function ()
{
 this.sort ();
 var re=[this[0]];
 for (var i = 1; i < this.length i++)
 {
 if (This[i]!== re[re.length-1])
 {
  Re.push (this[i));
 }
 return re;
}

The idea of this method is to sort the array first and then compare the adjacent two values. The sort time uses the JS native sort method, the JS engine interior should be uses the quick sort. The result of the final test is that this method runs about three times times the average of the second method, but much faster than the first and third methods.

Thank you for reading, I hope to help you, thank you for your support for this site!