c++ - 您如何将该C++程序转换为C程序？

Question

Closed. This question needs to be more focused。它当前不接受答案。
                            
                        
                    
                
                            
                                
                
                        
                            
                        
                    
                        
                            想改善这个问题吗？更新问题，使其仅通过 editing this post专注于一个问题。
                        
                        4个月前关闭。
                                                                                            
                
        
谢谢您提前的时间，我正在努力将代码转换为C语言，我才刚刚进入编程世界，所以如果您有任何疑问，我可以回答，这就是代码...

// C++ program for implementation of Heap Sort 
#include <iostream> 

using namespace std; 

// To heapify a subtree rooted with node i which is 
// an index in arr[]. n is size of heap 
void heapify(int arr[], int n, int i) 
{ 
    int largest = i; // Initialize largest as root 
    int l = 2*i + 1; // left = 2*i + 1 
    int r = 2*i + 2; // right = 2*i + 2 

    // If left child is larger than root 
    if (l < n && arr[l] > arr[largest]) 
        largest = l; 

    // If right child is larger than largest so far 
    if (r < n && arr[r] > arr[largest]) 
        largest = r; 

    // If largest is not root 
    if (largest != i) 
    { 
        swap(arr[i], arr[largest]); 

        // Recursively heapify the affected sub-tree 
        heapify(arr, n, largest); 
    } 
} 

// main function to do heap sort 
void heapSort(int arr[], int n) 
{ 
    // Build heap (rearrange array) 
    for (int i = n / 2 - 1; i >= 0; i--) 
        heapify(arr, n, i); 

    // One by one extract an element from heap 
    for (int i=n-1; i>=0; i--) 
    { 
        // Move current root to end 
        swap(arr[0], arr[i]); 

        // call max heapify on the reduced heap 
        heapify(arr, i, 0); 
    } 
} 

/* A utility function to print array of size n */
void printArray(int arr[], int n) 
{ 
    for (int i=0; i<n; ++i) 
        cout << arr[i] << " "; 
    cout << "\n"; 
} 

// Driver program 
int main() 
{ 
    int arr[] = {12, 11, 13, 5, 6, 7}; 
    int n = sizeof(arr)/sizeof(arr[0]); 

    heapSort(arr, n); 

    cout << "Sorted array is \n"; 
    printArray(arr, n); 
}

在那之后，我将不得不添加另一个函数，但这就是第二天的故事，能够进行转换将对我开始使用C ++有很多帮助。另外，我应该首先尝试专注于哪一个？英语不是我的主要语言，抱歉，如果我有一些错误。

最佳答案

只需实现swap()，在这里内联，因为它很简单，并且消除了使用指针的麻烦。

使用printf()进行输出。

删除名称空间，并将C库用于标准io。

#include <stdio.h>
// C program for implementation of Heap Sort 

// To heapify a subtree rooted with node i which is 
// an index in arr[]. n is size of heap 
void heapify(int arr[], int n, int i) 
{ 
    int largest = i; // Initialize largest as root 
    int l = 2*i + 1; // left = 2*i + 1 
    int r = 2*i + 2; // right = 2*i + 2 

    // If left child is larger than root 
    if (l < n && arr[l] > arr[largest]) 
        largest = l; 

    // If right child is larger than largest so far 
    if (r < n && arr[r] > arr[largest]) 
        largest = r; 

    // If largest is not root 
    if (largest != i) 
    { 
        int temp;
        temp = arr[i];
        arr[i] = arr[largest];
        arr[largest] = temp;

        // Recursively heapify the affected sub-tree 
        heapify(arr, n, largest); 
    } 
} 

// main function to do heap sort 
void heapSort(int arr[], int n) 
{ 
    // Build heap (rearrange array) 
    for (int i = n / 2 - 1; i >= 0; i--) 
        heapify(arr, n, i); 

    // One by one extract an element from heap 
    for (int i=n-1; i>=0; i--) 
    { 
        // Move current root to end 
        int temp;
        temp = arr[0];
        arr[0] = arr[i];
        arr[i] = temp;

        // call max heapify on the reduced heap 
        heapify(arr, i, 0); 
    } 
} 

/* A utility function to print array of size n */
void printArray(int arr[], int n) 
{ 
    for (int i=0; i<n; ++i) 
        printf("%i ", arr[i]);
    printf("\n");
} 

// Driver program 
int main() 
{ 
    int arr[] = {12, 11, 13, 5, 6, 7}; 
    int n = sizeof(arr)/sizeof(arr[0]); 

    heapSort(arr, n); 

    printf("Sorted array is \n");
    printArray(arr, n); 
}

编译/链接：

gcc -g -std=c11 -c main.c
gcc main.o -o main.exe

输出：

Sorted array is
5 6 7 11 12 13

关于c++ - 您如何将该C++程序转换为C程序？ ，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/58549883/

上一篇：c - 为什么 HeapFree 之后堆内存仍然可以访问

下一篇：c - 这行数字有特定的顺序吗？

相关文章：

c++ - 指针行为给出的值为 1

c - 在 C 中使用 pthreads 的数组的最小值和最大值

Javascript 将 2 个数组映射到 1 个对象

c++ - Delphi 函数和 C++ 中的等效函数

c++ - 使用 stringstream，我如何解析这些字符串？

c - 在 GNU 链接描述文件中带有空输入段列表的 `section` 命令有什么影响？

arrays - 将矩阵添加到 R 中的列表

c++ - 隐式转换为显式 bool 类型以对容器进行排序？

c++ - 关闭套接字不释放文件描述符

c - 为什么 valgrind 将我的内存报告为 "definitely lost"？

Answer 1

只需实现swap()，在这里内联，因为它很简单，并且消除了使用指针的麻烦。

使用printf()进行输出。

删除名称空间，并将C库用于标准io。

#include <stdio.h>
// C program for implementation of Heap Sort 

// To heapify a subtree rooted with node i which is 
// an index in arr[]. n is size of heap 
void heapify(int arr[], int n, int i) 
{ 
    int largest = i; // Initialize largest as root 
    int l = 2*i + 1; // left = 2*i + 1 
    int r = 2*i + 2; // right = 2*i + 2 

    // If left child is larger than root 
    if (l < n && arr[l] > arr[largest]) 
        largest = l; 

    // If right child is larger than largest so far 
    if (r < n && arr[r] > arr[largest]) 
        largest = r; 

    // If largest is not root 
    if (largest != i) 
    { 
        int temp;
        temp = arr[i];
        arr[i] = arr[largest];
        arr[largest] = temp;

        // Recursively heapify the affected sub-tree 
        heapify(arr, n, largest); 
    } 
} 

// main function to do heap sort 
void heapSort(int arr[], int n) 
{ 
    // Build heap (rearrange array) 
    for (int i = n / 2 - 1; i >= 0; i--) 
        heapify(arr, n, i); 

    // One by one extract an element from heap 
    for (int i=n-1; i>=0; i--) 
    { 
        // Move current root to end 
        int temp;
        temp = arr[0];
        arr[0] = arr[i];
        arr[i] = temp;

        // call max heapify on the reduced heap 
        heapify(arr, i, 0); 
    } 
} 

/* A utility function to print array of size n */
void printArray(int arr[], int n) 
{ 
    for (int i=0; i<n; ++i) 
        printf("%i ", arr[i]);
    printf("\n");
} 

// Driver program 
int main() 
{ 
    int arr[] = {12, 11, 13, 5, 6, 7}; 
    int n = sizeof(arr)/sizeof(arr[0]); 

    heapSort(arr, n); 

    printf("Sorted array is \n");
    printArray(arr, n); 
}

编译/链接：

gcc -g -std=c11 -c main.c
gcc main.o -o main.exe

输出：

Sorted array is
5 6 7 11 12 13