From 04757b6a57317cb9ea8eb1dc4ef049dcbdc03b89 Mon Sep 17 00:00:00 2001
From: mazezen <mazezen24@gmail.com>
Date: Sun, 11 Oct 2026 01:26:58 +0800
Subject: [PATCH] fix: remove redundant counter in C complexity examples
 (#1908)

Co-authored-by: krahets <krahets@163.com>
---
 codes/c/chapter_computational_complexity/time_complexity.c       | 1 -
 en/codes/c/chapter_computational_complexity/time_complexity.c    | 1 -
 ja/codes/c/chapter_computational_complexity/time_complexity.c    | 1 -
 ru/codes/c/chapter_computational_complexity/time_complexity.c    | 1 -
 .../codes/c/chapter_computational_complexity/time_complexity.c   | 1 -
 5 files changed, 5 deletions(-)

diff --git a/codes/c/chapter_computational_complexity/time_complexity.c b/codes/c/chapter_computational_complexity/time_complexity.c
index d7ffe9021..42509b202 100644
--- a/codes/c/chapter_computational_complexity/time_complexity.c
+++ b/codes/c/chapter_computational_complexity/time_complexity.c
@@ -10,7 +10,6 @@
 int constant(int n) {
     int count = 0;
     int size = 100000;
-    int i = 0;
     for (int i = 0; i < size; i++) {
         count++;
     }
diff --git a/en/codes/c/chapter_computational_complexity/time_complexity.c b/en/codes/c/chapter_computational_complexity/time_complexity.c
index 2094cfa70..b9842a68a 100644
--- a/en/codes/c/chapter_computational_complexity/time_complexity.c
+++ b/en/codes/c/chapter_computational_complexity/time_complexity.c
@@ -10,7 +10,6 @@
 int constant(int n) {
     int count = 0;
     int size = 100000;
-    int i = 0;
     for (int i = 0; i < size; i++) {
         count++;
     }
diff --git a/ja/codes/c/chapter_computational_complexity/time_complexity.c b/ja/codes/c/chapter_computational_complexity/time_complexity.c
index ff4c9c00d..44a353135 100644
--- a/ja/codes/c/chapter_computational_complexity/time_complexity.c
+++ b/ja/codes/c/chapter_computational_complexity/time_complexity.c
@@ -10,7 +10,6 @@
 int constant(int n) {
     int count = 0;
     int size = 100000;
-    int i = 0;
     for (int i = 0; i < size; i++) {
         count++;
     }
diff --git a/ru/codes/c/chapter_computational_complexity/time_complexity.c b/ru/codes/c/chapter_computational_complexity/time_complexity.c
index 56720669b..bcf277f45 100644
--- a/ru/codes/c/chapter_computational_complexity/time_complexity.c
+++ b/ru/codes/c/chapter_computational_complexity/time_complexity.c
@@ -10,7 +10,6 @@
 int constant(int n) {
     int count = 0;
     int size = 100000;
-    int i = 0;
     for (int i = 0; i < size; i++) {
         count++;
     }
diff --git a/zh-hant/codes/c/chapter_computational_complexity/time_complexity.c b/zh-hant/codes/c/chapter_computational_complexity/time_complexity.c
index 280eee938..15ebb12c9 100644
--- a/zh-hant/codes/c/chapter_computational_complexity/time_complexity.c
+++ b/zh-hant/codes/c/chapter_computational_complexity/time_complexity.c
@@ -10,7 +10,6 @@
 int constant(int n) {
     int count = 0;
     int size = 100000;
-    int i = 0;
     for (int i = 0; i < size; i++) {
         count++;
     }