If you ordered the OTS package, you don’t need installation so you can skip next chapter. When booting, MME and eNB are automatically started within a screen. If you are not familiar with screen here is what you must know: • To have access to consoles, log on the machine with root access, then type: screen -r • To access MME monitor: CTRL-A + 0 • To access eNB monitor: CTRL-A + 1 • To exit screen: CTRL-A + d 在ssh怎么使用

如果你使用 SSH 连接到机器，可以按照以下步骤使用 screen：

1. 使用 SSH 工具连接到机器。

2. 在终端中输入 `screen -r` 命令，这将连接到之前启动的 screen 会话。

3. 如果你需要访问 MME 监视器，可以按下 `Ctrl+a` 和 `0` 来切换到 MME 控制台。

4. 如果你需要访问 eNB 监视器，可以按下 `Ctrl+a` 和 `1` 来切换到 eNB 控制台。

5. 如果你想退出 screen，可以按下 `Ctrl+a` 和 `d` 来分离当前会话。

注意，如果你在本地终端中同时使用了 screen，那么在远程连接时可能会出现一些问题。在这种情况下，你需要创建一个新的 screen 会话来避免冲突。

相关问题

If you ordered the OTS package, you don’t need installation so you can skip next chapter. When booting, MME and eNB are automatically started within a screen. If you are not familiar with screen here is what you must know: • To have access to consoles, log on the machine with root access, then type: screen -r • To access MME monitor: CTRL-A + 0 • To access eNB monitor: CTRL-A + 1 • To exit screen: CTRL-A + d

这段文字提供了一些关于 OTS 包的信息以及关于 screen 的使用方法。如果你已经订购了 OTS 包，那么你不需要进行安装，可以跳过下一章节。在启动时，MME 和 eNB 会自动在一个 screen 中启动。如果你不熟悉 screen，你需要知道以下几点：

- 要访问控制台，请使用 root 权限登录到机器上，然后输入：screen -r。
- 要访问 MME 监视器，请按下 CTRL-A + 0。
- 要访问 eNB 监视器，请按下 CTRL-A + 1。
- 要退出 screen，请按下 CTRL-A + d。

这些快捷键可以让你在 screen 中轻松地切换控制台和退出 screen。

There are several other sorting algorithms besides selection sort that makesense at your level of programming knowledge. Unfortunately, those algorithms donot offer any advantages over selection sort in terms of their algorithmperformance. Even so, coding these algorithms gives you more practice usingarrays.For example, you can sort an integer array from lowest to highest by applyingthe following procedure. Start by going through the array, looking at adjacent pairsof values. If the values forming the pair are correctly ordered, do nothing; if thevalues are out of order, swap them. In either case, move on the next pair ofvalues. The pairs overlap as you move through the list so that the second elementin one pair becomes the first element of the next pair. Repeat this operation untilyou make a complete pass in which you do not need to exchange any integers.This algorithm is called bubble sort, because the values seem to “bubble up” totheir eventual positions.Reimplement the SortIntegerArray function using the bubble sort algorithm.

Sure, I can help you with that. Here's the implementation of the SortIntegerArray function using the bubble sort algorithm:

void SortIntegerArray(int arr[], int size) {
  for (int i = 0; i < size - 1; i++) {
    for (int j = 0; j < size - i - 1; j++) {
      if (arr[j] > arr[j+1]) {
        int temp = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = temp;
      }
    }
  }
}

This function takes an integer array and its size as input, and then sorts the array using the bubble sort algorithm. The outer loop runs from 0 to size-1, and the inner loop runs from 0 to size-i-1. In each iteration of the inner loop, we compare adjacent pairs of values and swap them if they are out of order. This process is repeated until we make a complete pass in which we do not need to exchange any integers.

I hope this helps! Let me know if you have any further questions.