Home/ Questions/Q 131171
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-11T06:03:48+00:00

Given two arrays, is there a fast algorithm for finding all elements in the

  • 0

Given two arrays, is there a fast algorithm for finding all elements in the two that are different? For example, consider two arrays of Keys (as in keyboard keys) structs. One represents the currently depressed keys, and the other represents the keys depressed in the last timestep.

Keys[] oldKeys = LastKeyboardState.GetPressedKeys(); Keys[] currKeys = CurrentKeyboardState.GetPressedKeys();  // the user just pressed these key(s) during the last timestep. Keys[] diff = ...

Suggestions are much appreciated!

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Try this

    var diff = oldKeys.Except(currKeys);

    This requires C# 3.0

    • 0