編集履歴

質問編集履歴

追記

2020/06/30 17:25

投稿

submaru

スコア18

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -1,3 +1,561 @@
 cc -Wall -W ファイル名
 でコンパイルした際、宣言して使っているにも関わらずコンパイル時に「使用されない変数」と出てきてしまいます。原因として考えられるのはどんなことですか？-Dオプションを使っているのですが、関係はあるのでしょうか？
+### 該当のソースコード
+```c
+#include <stdio.h>
+#include <stdlib.h>
+#ifdef hairetsu_riyou
+void bubble_sort_array(int a[], int n);
+void selection_sort_array(int a[], int n);
+void insertion_sort_array(int a[], int n);
+void shell_sort_array(int a[], int n);
+#else
+typedef  struct {
+        int key;
+        int data;
+}kozotai;
+void bubble_sort_kozotai(kozotai a[] , int n);
+void selection_sort_kozotai(kozotai a[] , int n);
+void insertion_sort_kozotai(kozotai a[] , int n);
+void shell_sort_kozotai(kozotai a[], int n);
+#endif
+int main(void){
+        int i, tmp;
+        int n=100;
+#ifdef hairetsu_riyou
+        int hairetsu[100]={412, 54, 595, 329, 24, 488, 313, 272, 129, 210,
+                670, 516, 342, 541, 491, 640, 167, 117, 726, 206,
+                474, 762, 153, 292, 1000, 607, 151, 661, 93, 270,
+                737, 531, 641, 548, 299, 287, 547, 394, 550, 474,
+                443, 261, 707, 503, 403, 739, 226, 646, 778, 588,
+                427, 169, 477, 572, 412, 299, 88, 321, 54, 778,
+                541, 680, 210, 272, 288, 276, 405, 307, 424, 668,
+                756, 255, 190, 449, 35, 435, 91, 486, 58, 408,
+                4, 63, 534, 329, 701, 65, 256, 311, 586, 403,
+                459, 254, 291, 333, 42, 343, 418, 512, 164, 56};
+        for(i=0;i<n;i++){
+                printf("hairetsu[%d]= %d\n" , i,  hairetsu[i]);
+        }
+#ifdef BUB
+        bubble_sort_array(hairetsu ,n);
+#endif
+#ifdef SEL
+        selection_sort_array(hairetsu, n);
+#endif
+#ifdef INS
+        insertion_sort_array(hairetsu, n);
+#endif
+#ifdef SHL
+        shell_sort_array(hairetsu, n);
+#endif
+        printf("\n\nソート後\n\n");
+        for(i=0;i<n;i++){
+                printf("hairetsu[%d]= %d\n" , i,  hairetsu[i]);
+        }
+        tmp = hairetsu[9]; hairetsu[9] = hairetsu[89]; hairetsu[89] = tmp;
+        tmp = hairetsu[49]; hairetsu[49] = hairetsu[59]; hairetsu[59] = tmp;
+        printf("\n\nほぼソート済\n\n");
+        for(i=0;i<n;i++){
+                printf("hairetsu[%d]= %d\n" , i,  hairetsu[i]);
+        }
+#ifdef BUB
+        bubble_sort_array(hairetsu ,n);
+#endif
+#ifdef SEL
+        selection_sort_array(hairetsu, n);
+#endif
+#ifdef INS
+        insertion_sort_array(hairetsu, n);
+#endif
+#ifdef SHL
+        shell_sort_array(hairetsu, n);
+#endif
+        printf("\n\nソート後\n\n");
+        for(i=0;i<n;i++){
+                printf("hairetsu[%d]= %d\n" , i,  hairetsu[i]);
+        }
+#else
+        kozotai table[100];
+        for(i=0;i<n;i++){
+                table[i].key=i;
+                table[i].data=rand()%893;
+        }
+        for(i=0;i<n;i++){
+                printf("table[%d].key= %d table[%d].data= %d\n" , i,  table[i].key, i, table[i].data);
+        }
+#ifdef BUB
+        bubble_sort_kozotai(table, n);
+#endif
+#ifdef SEL
+        selection_sort_kozotai(table, n);
+#endif
+#ifdef INS
+        insertion_sort_kozotai(table, n);
+#endif
+#ifdef SHE
+        shell_sort_kozotai(table, n);
+#endif
+        printf("\n\nソート後\n\n");
+        for(i=0;i<n;i++){
+                printf("table[%d].key= %d table[%d].data= %d\n" , i,  table[i].key, i, table[i].data);
+        }
+#endif
+        return 0;
+}
+#if hairetsu_riyou
+void bubble_sort_array(int a[], int n);
+        int i, j, t;
+        for (i = 0; i < n-1; i++) {
+          j = n;
+          while (j > i) {
+            if (a[j-1] > a[j]) {
+              t = a[j];
+              a[j] = a[j-1];
+              a[j-1] = t;
+            }
+            j--;
+          }
+        }
+}
+void selection_sort_array(int a[], int n){
+        int i, j, t, lowest, lowkey;
+        for (i = 0; i < n-1; i++) {
+          lowest = i;
+          lowkey = a[i];
+          for (j = i+1; j < n; j++) {
+            if (lowkey > a[j]) {
+              lowest = j;
+              lowkey = a[j];
+          }
+          t = a[lowest];
+          a[lowest] = a[i];
+          a[i] = t;
+        }
+}
+void insertion_sort_array(int a[], int n){
+        int i, j, t;
+        for(i=1; i<n; i++ ){
+                j=i;
+                while(j>=1 &&  a[j-1] >a[j]){
+                        t = a[j];
+                        a[j]=a[j-1];
+                        a[j-1]=t;
+                        j--;
+                }
+        }
+}
+void shell_sort_array(int a[], int n){
+        int i, j, k, t, w, hikaku=0, koukan=0;
+        t = n / 2;
+        while (t > 0) {
+          for (i = 1; i <= t; i++) {
+            for (j = i + t; i <= n; j = j + t) {
+              w = a[j];
+              k = j - t;
+              while (k > 0) {
+                if (a[k] <= w) {break;}
+                a[k+t] = a[k];
+                k = k - t;
+              }
+              a[k+t] = w;
+            }
+          }
+          t = t / 2;
+        }
+}
+#else
+void bubble_sort_kozotai(kozotai a[], int n){
+  int i, j;
+  kozotai t;
+  for (i = 0; i < n-1; i++) {
+    j = n;
+    while (j > i) {
+      if (a[j-1].data > a[j].data) {
+        t = a[j];
+        a[j] = a[j-1];
+        a[j-1] = t;
+      }
+      j--;
+    }
+  }
+}
+void selection_sort_kozotai(kozotai a[], int n){
+  int i, j, lowest, lowkey;
+  kozotai t;
+  for (i = 0; i < n-1; i++) {
+    lowest = i;
+    lowkey = a[i].data;
+    for (j = i+1; j < n; j++) {
+      if (a[lowest].data > a[j].data) {
+        lowest = j;
+        lowkey = a[j].data;
+      }
+    }
+    t = a[lowest];
+    a[lowest] = a[i];
+    a[i] = t;
+  }
+}
+void insertion_sort_kozotai(kozotai a[], int n){
+  int i, j;
+  kozotai t;
+  for(i=1; i<n; i++ ){
+    j=i;
+    while(j>=1 &&  a[j-1].data >a[j].data){
+      t = a[j];
+      a[j]=a[j-1];
+      a[j-1]=t;
+      j--;
+    }
+  }
+}
+void shell_sort_kozotai(kozotai a[], int n){
+  int i, j, k, t;
+  kozotai w;
+  t = n / 2;
+  while (t > 0) {
+    for (i = 1; i <= t; i++) {
+      for (j = i + t; i <= n; j = j + t) {
+        w = a[j];
+        k = j - t;
+        while (k > 0) {
+          if (a[k].data <= w.data) {break;}
+          a[k+t] = a[k];
+          k = k - t;
+        }
+        a[k+t] = w;
+      }
+    }
+    t = t / 2;
+  }
+}
+#endif
+```