Member Avatar for Phil++

Hey,

I'm looking for some help and advice on set theory.

Is set theory like arrays in C# and C++ for example? Like:

S = {1,2,3,4,5,6} // is a set of integers

But how do you access each member? For example, in C++:

cout << S[1]; // prints 1

Can someone explain (in simple terms) set theory? I'm confused :(

  • 3 Contributors
  • 2 Replies
  • 101 Views
  • 13 Hours Discussion Span
  • Latest Post Latest Post by mrnutty

Dani AI

Generated

Math sets (the subject pointed to) are a mathematical concept: an unordered collection of distinct elements. There is no built‑in notion of “first” or “second” element in a pure set, and you do not access members by numeric index the way you do with arrays. That difference is the key source of the confusion.

In programming, “set” is a container type that enforces uniqueness and gives fast membership tests, inserts and deletes. Some implementations are ordered (C++ std::set, C# SortedSet<T>) and iterate in a defined order; others are hash-based (C++ std::unordered_set, C# HashSet<T>) and do not guarantee iteration order. If you need index-style random access, use a sequence (array/list/vector) or convert the set into one. See the C++ reference for std::set and the .NET docs for HashSet<T> for APIs and complexity notes: C++ std::set reference and C# HashSet<T> documentation.

Practical patterns:

  • Test membership with find/Contains instead of indexing.
  • Iterate with a range-based loop or iterator.
  • If you must get the “kth” element, either use an ordered set and advance an iterator, or copy the set into a vector/list and index that sequence.

Example snippets (minimal):

#include <set>
#include <vector>
#include <iterator>
// membership
std::set<int> s = {10, 30, 20};
if (s.find(20) != s.end()) { / present / }
// kth element (ordered)
auto it = s.begin(); std::advance(it, 1); int second = *it;
// or for random access
std::vector<int> v(s.begin(), s.end()); int idx = v[1];

using System.Collections.Generic;
using System.Linq;
var set = new HashSet<int> { 10, 30, 20 };
if (set.Contains(20)) { / present / }
var list = set.ToList(); var second = list[1]; // order not guaranteed for HashSet

If the question is about mathematical set theory rather than code, start with a short reference on the math definition and properties: . For code, pick the container whose semantics match your needs: uniqueness and membership (set) vs ordered indexing and random access (array/list).

Recommended Answers

All 2 Replies

Member Avatar for mrnutty

Is set theory like arrays in C# and C++ for example?

No no where close. Set theory is a branch of mathematics. Check here for more info.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.