Minimum operations of the given type required to make a complete graph | C # implementation of the approach ; Function to return the minimum number of steps required ; Driver Code
using System ; class GFG { static int minOperations ( int N ) { double x = Math . Log ( N , 2 ) ; int ans = ( int ) ( Math . Ceiling ( x ) ) ; return ans ; } static void Main ( ) { int N = 10 ; Console . WriteLine ( minOperations ( N ) ) ; } }