Instantly convert code snippets from Go to Delphi with our free online code converter. Transform your code easily and accurately.
Experience the full potential of AI-driven code conversion and transformation!
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.
Go is a statically typed, compiled programming language designed at Google. Go is syntactically similar to C, but with memory safety, garbage collection, structural typing, and CSP-style concurrency.
Delphi is an event-driven programming language based on Object Pascal.
package main
import (
"fmt"
"strings"
"unicode"
)
func isPalindrome(s string) bool {
// Clean the string
clean := strings.Map(func(r rune) rune {
if unicode.IsLetter(r) || unicode.IsNumber(r) {
return unicode.ToLower(r)
}
return -1
}, s)
// Check palindrome
for i := 0; i < len(clean)/2; i++ {
if clean[i] != clean[len(clean)-1-i] {
return false
}
}
return true
}
func main() {
fmt.Println(isPalindrome("A man, a plan, a canal: Panama")) // true
fmt.Println(isPalindrome("race a car")) // false
}
function IsPalindrome(const S: string): Boolean;
var
CleanStr: string;
I: Integer;
begin
// Remove non-alphanumeric characters and convert to lowercase
CleanStr := '';
for I := 1 to Length(S) do
if S[I].IsLetterOrDigit then
CleanStr := CleanStr + S[I].ToLower;
// Check if the string is equal to its reverse
Result := CleanStr = ReverseString(CleanStr);
end;
// Example usage
WriteLn(IsPalindrome('A man, a plan, a canal: Panama')); // True
WriteLn(IsPalindrome('race a car')); // False
package main
import "fmt"
func bubbleSort(arr []int) {
n := len(arr)
for i := 0; i < n; i++ {
for j := 0; j < n-i-1; j++ {
if arr[j] > arr[j+1] {
arr[j], arr[j+1] = arr[j+1], arr[j]
}
}
}
}
func main() {
arr := []int{64, 34, 25, 12, 22, 11, 90}
bubbleSort(arr)
fmt.Println(arr)
}
procedure BubbleSort(var Arr: array of Integer);
var
I, J, Temp: Integer;
begin
for I := High(Arr) downto Low(Arr) do
for J := Low(Arr) to I - 1 do
if Arr[J] > Arr[J + 1] then
begin
Temp := Arr[J];
Arr[J] := Arr[J + 1];
Arr[J + 1] := Temp;
end;
end;
// Example usage
var
Arr: array of Integer;
begin
SetLength(Arr, 7);
Arr[0] := 64; Arr[1] := 34; Arr[2] := 25; Arr[3] := 12;
Arr[4] := 22; Arr[5] := 11; Arr[6] := 90;
WriteLn('Original array:');
PrintArray(Arr);
BubbleSort(Arr);
WriteLn('Sorted array:');
PrintArray(Arr);
end;
Convert Go to Python
Open ConverterConvert Go to JavaScript
Open ConverterConvert Go to TypeScript
Open ConverterConvert Go to Java
Open ConverterConvert Go to C
Open ConverterConvert Go to C++
Open ConverterConvert Go to C#
Open ConverterConvert Go to Dart
Open ConverterConvert Go to Ruby
Open ConverterConvert Go to Swift
Open ConverterConvert Go to Kotlin
Open ConverterConvert Go to Rust
Open ConverterConvert Go to Scala
Open ConverterConvert Go to PHP
Open ConverterConvert Go to R
Open ConverterConvert Go to Haskell
Open ConverterConvert Go to Julia
Open ConverterConvert Go to MATLAB
Open ConverterConvert Go to Lua
Open ConverterConvert Go to Assembly
Open ConverterConvert Go to Perl
Open ConverterConvert Go to Groovy
Open ConverterConvert Go to Elixir
Open ConverterConvert Go to F#
Open ConverterConvert Go to Clojure
Open Converter