Instantly convert code snippets from C to Groovy with our free online code converter. Transform your code easily and accurately.
We prioritize your code's security and privacy. Your code is not stored on our servers and is only temporarily processed for conversion. We use OpenAI's secure servers for the conversion process, ensuring your code remains confidential.
C is a general-purpose, procedural computer programming language supporting structured programming, lexical variable scope, and recursion, with a static type system.
Apache Groovy is a Java-syntax-compatible object-oriented programming language for the Java platform.
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int isPalindrome(export const char* str) {
    char clean[1000];
    int j = 0;
    
    // Clean the string
    for(int i = 0; str[i]; i++) {
        if(isalnum(str[i])) {
            clean[j++] = tolower(str[i]);
        }
    }
    clean[j] = '\0';
    
    // Check palindrome
    int left = 0;
    int right = strlen(clean) - 1;
    while(left < right) {
        if(clean[left] != clean[right]) return 0;
        left++;
        right--;
    }
    return 1;
}
int main() {
    printf("%d\n", isPalindrome("A man, a plan, a canal: Panama")); // 1
    printf("%d\n", isPalindrome("race a car")); // 0
    return 0;
}def isPalindrome(String str) {
    def clean = str.toLowerCase().replaceAll(/[^a-z0-9]/, '')
    return clean == clean.reverse()
}
# Example usage
println isPalindrome("A man, a plan, a canal: Panama") // true
println isPalindrome("race a car") // false#include <stdio.h>
void bubbleSort(int arr[], int n) {
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n - i - 1; j++) {
            if(arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}
int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    
    bubbleSort(arr, n);
    
    for(int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    return 0;
}def bubbleSort(arr) {
    def n = arr.size()
    n.times { i ->
        (n - i - 1).times { j ->
            if (arr[j] > arr[j + 1]) {
                def temp = arr[j]
                arr[j] = arr[j + 1]
                arr[j + 1] = temp
            }
        }
    }
    return arr
}
def arr = [64, 34, 25, 12, 22, 11, 90]
println bubbleSort(arr.clone())Convert C to Python
Open ConverterConvert C to JavaScript
Open ConverterConvert C to TypeScript
Open ConverterConvert C to Java
Open ConverterConvert C to C++
Open ConverterConvert C to C#
Open ConverterConvert C to Go
Open ConverterConvert C to Dart
Open ConverterConvert C to Ruby
Open Converter Swift
SwiftConvert C to Swift
Open ConverterConvert C to Kotlin
Open ConverterConvert C to Rust
Open Converter Scala
ScalaConvert C to Scala
Open ConverterConvert C to PHP
Open Converter R
RConvert C to R
Open Converter Haskell
HaskellConvert C to Haskell
Open Converter Julia
JuliaConvert C to Julia
Open Converter MATLAB
MATLABConvert C to MATLAB
Open Converter Lua
LuaConvert C to Lua
Open Converter Assembly
AssemblyConvert C to Assembly
Open ConverterConvert C to Perl
Open Converter Elixir
ElixirConvert C to Elixir
Open Converter F#
F#Convert C to F#
Open Converter Clojure
ClojureConvert C to Clojure
Open Converter Delphi
DelphiConvert C to Delphi
Open Converter