Print sorted distinct elements of array
Last Updated :
11 Aug, 2023
Given an array that might contain duplicates, print all distinct elements in sorted order.
Examples:
Input : 1, 3, 2, 2, 1
Output : 1 2 3
Input : 1, 1, 1, 2, 2, 3
Output : 1 2 3
The simple Solution is to sort the array first, then traverse the array and print only first occurrences of elements.
Algorithm:
- Sort the given array in non-descending order.
- Traverse the sorted array from left to right, and for each element do the following:
a. If the current element is not equal to the previous element, print the current element.
b. Otherwise, skip the current element and move on to the next one. - Stop when the end of the array is reached.
Below is the implementation of the approach:
C++
// CPP program to print sorted distinct
// elements.
#include <bits/stdc++.h>
using namespace std;
// Function to print sorted distinct
// elements
void printDistinct(int arr[], int n) {
// Sort the array
sort(arr, arr + n);
// Traverse the sorted array
for (int i = 0; i < n; i++) {
// If the current element is not equal to the previous
// element, print it
if (i == 0 || arr[i] != arr[i - 1])
cout << arr[i] << " ";
}
}
// Driver's code
int main() {
// Input array
int arr[] = { 1, 3, 2, 2, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
// Function call
printDistinct(arr, n);
return 0;
}
// Java program to print sorted distinct
// elements.
import java.util.*;
class GFG {
// Function to print sorted distinct
// elements
static void printDistinct(int arr[], int n) {
// Sort the array
Arrays.sort(arr);
// Traverse the sorted array
for (int i = 0; i < n; i++) {
// If the current element is not equal to the
// previous element, print it
if (i == 0 || arr[i] != arr[i - 1])
System.out.print(arr[i] + " ");
}
}
// Driver's code
public static void main(String[] args) {
// Input array
int arr[] = { 1, 3, 2, 2, 1 };
int n = arr.length;
// Function call
printDistinct(arr, n);
}
}
# Python program to print sorted distinct elements
def printDistinct(arr):
# Sort the array
arr.sort()
# Traverse the sorted array
for i in range(len(arr)):
# If the current element is not equal to the previous
# element, print it
if i == 0 or arr[i] != arr[i - 1]:
print(arr[i])
# Driver code
arr = [1, 3, 2, 2, 1]
printDistinct(arr)
using System;
using System.Linq;
class GFG {
// Function to print sorted distinct elements
static void printDistinct(int[] arr, int n) {
// Sort the array
Array.Sort(arr);
// Traverse the sorted array
for (int i = 0; i < n; i++) {
// If the current element is not equal to the previous element, print it
if (i == 0 || arr[i] != arr[i - 1])
Console.Write(arr[i] + " ");
}
}
// Driver's code
public static void Main() {
// Input array
int[] arr = { 1, 3, 2, 2, 1 };
int n = arr.Length;
// Function call
printDistinct(arr, n);
}
}
// THIS CODE IS CONTRIBUTED BY CHANDAN AGARWAL
// Javascript program to print sorted distinct
// elements.
function printDistinct(arr) {
// Sort the array
arr.sort((a, b) => a - b);
// Traverse the sorted array
for (let i = 0; i < arr.length; i++) {
// If the current element is not equal to the previous
// element, print it
if (i === 0 || arr[i] !== arr[i - 1]) {
console.log(arr[i]);
}
}
}
// Driver code
const arr = [1, 3, 2, 2, 1];
printDistinct(arr);
Time Complexity: O(n * logn) as sort function has been called which takes O(n * logn) time. Here, n is size of the input array.
Auxiliary Space: O(1) as no extra space has been used.
Another Approach is to use set in C++ STL.
Implementation:
C++
// CPP program to print sorted distinct
// elements.
#include <bits/stdc++.h>
using namespace std;
void printRepeating(int arr[], int size)
{
// Create a set using array elements
set<int> s(arr, arr + size);
// Print contents of the set.
for (auto x : s)
cout << x << " ";
}
// Driver code
int main()
{
int arr[] = { 1, 3, 2, 2, 1 };
int n = sizeof(arr) / sizeof(arr[0]);
printRepeating(arr, n);
return 0;
}
// Java program to print sorted distinct
// elements.
import java.io.*;
import java.util.*;
public class GFG {
static void printRepeating(Integer []arr, int size)
{
// Create a set using array elements
SortedSet<Integer> s = new TreeSet<>();
Collections.addAll(s, arr);
// Print contents of the set.
System.out.print(s);
}
// Driver code
public static void main(String args[])
{
Integer []arr = {1, 3, 2, 2, 1};
int n = arr.length;
printRepeating(arr, n);
}
}
// This code is contributed by
// Manish Shaw (manishshaw1)
# Python3 program to print
# sorted distinct elements.
def printRepeating(arr,size):
# Create a set using array elements
s = set()
for i in range(size):
if arr[i] not in s:
s.add(arr[i])
# Print contents of the set.
for i in s:
print(i,end=" ")
# Driver code
if __name__=='__main__':
arr = [1,3,2,2,1]
size = len(arr)
printRepeating(arr,size)
# This code is contributed by
# Shrikant13
// C# program to print sorted distinct
// elements.
using System;
using System.Collections.Generic;
using System.Linq;
class GFG {
static void printRepeating(int []arr, int size)
{
// Create a set using array elements
SortedSet<int> s = new SortedSet<int>(arr);
// Print contents of the set.
foreach (var n in s)
{
Console.Write(n + " ");
}
}
// Driver code
public static void Main()
{
int []arr = {1, 3, 2, 2, 1};
int n = arr.Length;
printRepeating(arr, n);
}
}
// This code is contributed by
// Manish Shaw (manishshaw1)
<script>
// Javascript program to print sorted distinct
// elements.
function printRepeating(arr, size)
{
// Create a set using array elements
var s = new Set(arr);
// Print contents of the set.
[...s].sort((a, b) => a - b).forEach(x => {
document.write(x + " ")
});
}
// Driver code
var arr = [ 1, 3, 2, 2, 1 ];
var n = arr.length;
printRepeating(arr, n);
// This code is contributed by itsok
</script>
Complexity Analysis:
- Time Complexity: O(nlogn).
- Auxiliary Space: O(n)
Similar Reads
Print all Distinct (Unique) Elements in given Array Given an integer array arr[], print all distinct elements from this array. The given array may contain duplicates and the output should contain every element only once.Examples: Input: arr[] = {12, 10, 9, 45, 2, 10, 10, 45}Output: {12, 10, 9, 45, 2}Input: arr[] = {1, 2, 3, 4, 5}Output: {1, 2, 3, 4,
11 min read
Product of non-repeating (distinct) elements in an Array Given an integer array with duplicate elements. The task is to find the product of all distinct elements in the given array. Examples: Input : arr[] = {12, 10, 9, 45, 2, 10, 10, 45, 10}; Output : 97200 Here we take 12, 10, 9, 45, 2 for product because these are the only distinct elements Input : arr
15 min read
Count distinct elements in an array in Python Given an unsorted array, count all distinct elements in it. Examples: Input : arr[] = {10, 20, 20, 10, 30, 10} Output : 3 Input : arr[] = {10, 20, 20, 10, 20} Output : 2 We have existing solution for this article. We can solve this problem in Python3 using Counter method. Approach#1: Using Set() Thi
2 min read
Count Distinct ( Unique ) elements in an array Given an array arr[] of length N, The task is to count all distinct elements in arr[]. Examples: Input: arr[] = {10, 20, 20, 10, 30, 10}Output: 3Explanation: There are three distinct elements 10, 20, and 30. Input: arr[] = {10, 20, 20, 10, 20}Output: 2 Naïve Approach: Create a count variable and ru
15 min read
Distinct adjacent elements in an array Given an array, find whether it is possible to obtain an array having distinct neighbouring elements by swapping two neighbouring array elements. Examples: Input : 1 1 2 Output : YES swap 1 (second last element) and 2 (last element), to obtain 1 2 1, which has distinct neighbouring elements . Input
7 min read
Find sum of non-repeating (distinct) elements in an array Given an integer array with repeated elements, the task is to find the sum of all distinct elements in the array.Examples: Input : arr[] = {12, 10, 9, 45, 2, 10, 10, 45,10};Output : 78Here we take 12, 10, 9, 45, 2 for sumbecause it's distinct elements Input : arr[] = {1, 10, 9, 4, 2, 10, 10, 45 , 4}
14 min read
Find the only different element in an array Given an array of integers where all elements are same except one element, find the only different element in the array. It may be assumed that the size of the array is at least two.Examples: Input : arr[] = {10, 10, 10, 20, 10, 10} Output : 3 arr[3] is the only different element.Input : arr[] = {30
10 min read
Count pairs formed by distinct element sub-arrays Given an array, count number of pairs that can be formed from all possible contiguous sub-arrays containing distinct numbers. The array contains positive numbers between 0 to n-1 where n is the size of the array. Examples: Input: [1, 4, 2, 4, 3, 2] Output: 8 The subarrays with distinct elements are
7 min read
Find duplicate elements in an array Given an array of n integers. The task is to find all elements that have more than one occurrences. The output should only be one occurrence of a number irrespective of the number of occurrences in the input array.Examples: Input: {2, 10, 10, 100, 2, 10, 11, 2, 11, 2}Output: {2, 10, 11}Input: {5, 40
11 min read
Print all distinct strings from a given array Given an array of strings arr[] of size N, the task is to print all the distinct strings present in the given array. Examples: Input: arr[] = { "Geeks", "For", "Geeks", "Code", "Coder" } Output: Coder Code Geeks For Explanation: Since all the strings in the array are distinct, the required output is
5 min read