按最高有效位到最低有效位C#的顺序将位与short[]分隔

short[] array = new short[] { 32767, 12345, 0, -32768 };

StringBuilder result = new StringBuilder();

foreach (short num in array)
{
    // 将short类型的元素转换为二进制字符串
    string binary = Convert.ToString(num, 2);

    // 在二进制字符串前面补0，使其长度达到16位
    binary = binary.PadLeft(16, '0');

    // 将二进制字符串按最高有效位到最低有效位的顺序分隔
    for (int i = 0; i < binary.Length; i++)
    {
        result.Append(binary[i]);

        // 在每8位后添加一个空格，方便阅读
        if ((i + 1) % 8 == 0)
        {
            result.Append(" ");
        }
    }

    // 在每个short类型元素的分隔结束后添加一个换行符
    result.AppendLine();
}

Console.WriteLine(result.ToString());

using System;
using System.Text;

class Program
{
    static void Main()
    {
        short[] array = new short[] { 32767, 12345, 0, -32768 };
        StringBuilder result = new StringBuilder();

        foreach (short num in array)
        {
            string binary = Convert.ToString(num, 2);
            binary = binary.PadLeft(16, '0');

            for (int i = 0; i < binary.Length; i++)
            {
                result.Append(binary[i]);

                if ((i + 1) % 8 == 0)
                {
                    result.Append(" ");
                }
            }

            result.AppendLine();
        }

        Console.WriteLine(result.ToString());
    }
}