-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPrintRepeating.cs
More file actions
69 lines (64 loc) · 2.06 KB
/
PrintRepeating.cs
File metadata and controls
69 lines (64 loc) · 2.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace DA.Algorithms.Problems
{
public static class PrintRepeating
{
/// <summary>
/// Print duplicates in array. Time Complexity is O(n^2)
/// </summary>
/// <param name="array">collection of integer elements</param>
public static void BruteForce (int[] array)
{
Console.WriteLine ("Repeating elements are: [");
for (int i = 0; i < array.Length; i++)
{
for (int j = 0; j < array.Length; j++)
{
if (array[i] == array[j])
Console.Write (array[i] + " ");
}
}
Console.Write ("]");
}
/// <summary>
/// Print duplicates in array. Time Complexity is O(n.logn)
/// </summary>
/// <param name="array">collection of integer elements</param>
public static void UsingSorting (int[] array)
{
Array.Sort (array);
Console.WriteLine ("Repeating elements are: [");
for (int i = 0; i < array.Length; i++)
{
if (array[i] == array[i - 1])
Console.Write (array[i] + " ");
}
Console.Write ("]");
}
/// <summary>
/// Print duplicates in array. Time Complexity is O(n)
/// </summary>
/// <param name="array">collection of integer elements</param>
public static void UsingHashTable (int[] array)
{
HashSet<int> hashSet = new HashSet<int> ();
Console.WriteLine ("Repeating elements are: [");
for (int i = 0; i < array.Length; i++)
{
if (hashSet.Contains (array[i]))
{
Console.Write (array[i] + " ");
}
else
{
hashSet.Add (array[i]);
}
}
Console.Write ("]");
}
}
}