alpinistbg

program Project1;

const
  MAX = 20;

var
  A: array[0..MAX-1] of Integer;

function FindLM(I: Integer): Integer;
var

alpinistbg

void duff_copy(char *to, char *from, int count) {
  int n = (count + 7) / 8;
  switch (count % 8) {
    case 0: do { *to++ = *from++;
    case 7:      *to++ = *from++;
    case 6:      *to++ = *from++;
    case 5:      *to++ = *from++;
    case 4:      *to++ = *from++;
    case 3:      *to++ = *from++;
    case 2:      *to++ = *from++;

alpinistbg

unit
  array_of_const;

{$mode ObjFPC}{$H+}
{$modeswitch advancedrecords}

interface

uses
  Classes, SysUtils;

alpinistbg

List l = [12, 4, 2, 4, 55, 66, 3.14, 3, 12];

void main() {
  print('$l -> ${bubbleSort(List.from(l))}');
  print('$l -> ${selSort(List.from(l))}');
}

List bubbleSort(List l) {
  bool swap = true;
  while (swap) {

alpinistbg

typedef ListInt = List<int>;
ListInt l = [12, 14, 2, 5, 1298, 88, 2, 12, 14, 2, 5, 1298, 88, 2];

void main() {
  fun1(l);
  print('kesten= ${kestenSort(l)}');
  print('kesten2= ${kestenSort2(l)}');
  print('kesten3= ${kestenSort3(l)}');
}