Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 248657
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T21:21:41+00:00 2026-05-11T21:21:41+00:00

I am looking for an efficient way to detect the number of unique values

  • 0

I am looking for an efficient way to detect the number of unique values in an array.

My current approach:

  1. Quicksort array of integers
  2. Then run a loop to compare elements.

In code:

  yearHolder := '';
  for I := 0 to  High(yearArray) do
  begin
    currYear := yearArray[i];
    if (yearHolder <> currYear) then
    begin
      yearHolder := currYear;
      Inc(uniqueYearNumber);
    end;
  end;
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-11T21:21:41+00:00Added an answer on May 11, 2026 at 9:21 pm

    Here is an example with the THashedStringList:

    hl := THashedStringList.Create; // in Inifiles
    try
      hl.Sorted := True;
      hl.Duplicates := dupIgnore; // ignores attempts to add duplicates
      for i := 0 to  High(yearArray) do
        hl.Add(yearArray[i]);
      uniqueYearCount := hl.Count;
    finally
      hl.Free;
    end;
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm looking for an efficient way to get the list of unique commit authors
I am looking for the most efficient way to update a number of rows
I am looking for an efficient way to cut floating number at Javascript which
I'm looking for an efficient way to detect whether two java.io.File s refer to
I'm looking for an efficient way to store a huge number of booleans (up
I'm looking for the efficient way of replacing approximate values (ushort[100]) for their target
I'm looking for a efficient way in PHP to divide a number in equal
I have a table which contains many records. I'm looking for an efficient way
Looking for suggestions for an efficient way to maintain basic audit fields for entities
I am looking for a more efficient way to do comparisons between all elements

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.