https://github.com/ayubamini/distinctarray

https://github.com/ayubamini/distinctarray

arrays distinct quicksort

Last synced: 2 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/ayubamini/distinctarray
• Owner: ayubamini
• Created: 2021-06-26T19:36:04.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2021-06-26T21:54:00.000Z (over 4 years ago)
• Last Synced: 2025-05-05T02:54:16.498Z (8 months ago)
• Topics: arrays, distinct, quicksort
• Language: JavaScript
• Homepage:
• Size: 140 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Task Description

Write a function

function solution(A);

that, given an array A consisting of N integers, returns the number of distinct values in array A.

For example, given array A consisting of six elements such that:

     A[0] = 2    A[1] = 1    A[2] = 1

     A[3] = 2    A[4] = 3    A[5] = 1

     

the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3.

Write an efficient algorithm for the following assumptions:

    N is an integer within the range [0..100,000];

    each element of array A is an integer within the range [−1,000,000..1,000,000].

# Both Algoritm with same efficiency

     

     * JavaScript built-in sort (main.js)

     * Hands-on Quick sort (hands-on.sort.js)

# Analysis summary

![alt text](https://github.com/ayubamini/DistinctArray/blob/master/codility-score.PNG) 

![alt text](https://github.com/ayubamini/DistinctArray/blob/master/codility-analyse.PNG)