Instantly convert code snippets from C# 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.
C# is a general-purpose, multi-paradigm programming language encompassing strong typing, lexically scoped, imperative, declarative, functional, generic, object-oriented, and component-oriented programming disciplines.
Delphi is an event-driven programming language based on Object Pascal.
using System;
using System.Linq;
class Program {
static bool IsPalindrome(string str) {
string clean = new string(str.ToLower()
.Where(c => Char.IsLetterOrDigit(c))
.ToArray());
return clean.SequenceEqual(clean.Reverse());
}
static void Main() {
Console.WriteLine(IsPalindrome("A man, a plan, a canal: Panama")); // True
Console.WriteLine(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
using System;
class Program {
static void BubbleSort(int[] arr) {
int n = arr.Length;
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;
}
}
}
}
static void Main() {
int[] arr = { 64, 34, 25, 12, 22, 11, 90 };
BubbleSort(arr);
Console.WriteLine(string.Join(" ", 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 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 ConverterConvert C# to Swift
Open ConverterConvert C# to Kotlin
Open ConverterConvert C# to Rust
Open ConverterConvert C# to Scala
Open ConverterConvert C# to PHP
Open ConverterConvert C# to R
Open ConverterConvert C# to Haskell
Open ConverterConvert C# to Julia
Open ConverterConvert C# to MATLAB
Open ConverterConvert C# to Lua
Open ConverterConvert C# to Assembly
Open ConverterConvert C# to Perl
Open ConverterConvert C# to Groovy
Open ConverterConvert C# to Elixir
Open ConverterConvert C# to F#
Open ConverterConvert C# to Clojure
Open Converter