Instantly convert code snippets from Delphi to Elixir 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.
Delphi is an event-driven programming language based on Object Pascal.
Elixir is a functional, concurrent, general-purpose programming language.
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
defmodule Palindrome do
def is_palindrome(str) do
clean = str
|> String.downcase()
|> String.replace(~r/[^a-z0-9]/, "")
clean == String.reverse(clean)
end
end
# Example usage
IO.puts Palindrome.is_palindrome("A man, a plan, a canal: Panama") # true
IO.puts Palindrome.is_palindrome("race a car") # false
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;
defmodule Sort do
def bubble_sort(list) when length(list) <= 1, do: list
def bubble_sort(list) do
{new_list, swapped} = bubble_step(list, [], false)
if swapped, do: bubble_sort(new_list), else: new_list
end
defp bubble_step([a, b | tail], acc, swapped) when a > b do
bubble_step([a | tail], [b | acc], true)
end
defp bubble_step([a, b | tail], acc, swapped) do
bubble_step([b | tail], [a | acc], swapped)
end
defp bubble_step([a], acc, swapped), do: {Enum.reverse([a | acc]), swapped}
defp bubble_step([], acc, swapped), do: {Enum.reverse(acc), swapped}
end
arr = [64, 34, 25, 12, 22, 11, 90]
IO.inspect Sort.bubble_sort(arr)
Convert Delphi to Python
Open ConverterConvert Delphi to JavaScript
Open ConverterConvert Delphi to TypeScript
Open ConverterConvert Delphi to Java
Open ConverterConvert Delphi to C
Open ConverterConvert Delphi to C++
Open ConverterConvert Delphi to C#
Open ConverterConvert Delphi to Go
Open ConverterConvert Delphi to Dart
Open ConverterConvert Delphi to Ruby
Open ConverterConvert Delphi to Swift
Open ConverterConvert Delphi to Kotlin
Open ConverterConvert Delphi to Rust
Open ConverterConvert Delphi to Scala
Open ConverterConvert Delphi to PHP
Open ConverterConvert Delphi to R
Open ConverterConvert Delphi to Haskell
Open ConverterConvert Delphi to Julia
Open ConverterConvert Delphi to MATLAB
Open ConverterConvert Delphi to Lua
Open ConverterConvert Delphi to Assembly
Open ConverterConvert Delphi to Perl
Open ConverterConvert Delphi to Groovy
Open ConverterConvert Delphi to F#
Open ConverterConvert Delphi to Clojure
Open Converter