1onest4r

class Node {
  Node(this.value, {this.next});

  int value;
  Node? next;

  @override
  String toString() {
    final result = StringBuffer();
    result.write(value);

1onest4r

void main() {
  // final myList = [1, 2, 4, 5, 5, 6, 7, 8, 9, 10];
  final myList = [1, 1, 1, 2, 2, 2, 3, 3, 4, 5];
  final searchItem = 4;
  final index = binarySearch(myList, searchItem);

  if (index == null) {
    print('not found');
  } else {
    print("found searchitem at index $index");

1onest4r

void main() {
  print("Original:");
  final myList = [6, 9, 4, 1, 8, 5, 4, 3];
  print(myList);

  insertionSort(myList);
  print("Sorted:");
  print(myList);
}

1onest4r

void main() {
  final mylist = [6, 5, 4, 3, 2, 1];
  
  bubbleSort(mylist);
  //expecting [1, 2, 3, 4, 5, 6]
  print(mylist);
}

void bubbleSort(List<int> mylist) {
  for (int j = 0; j < mylist.length -1; j++) {

1onest4r

import 'dart:typed_data';

void main() {
  final myList = MyList();

  // Test with small numbers (1 byte)
  print("Testing small numbers (1 byte each):");
  myList.add(10);
  myList.add(255);
  print("List: $myList");

1onest4r

import 'dart:typed_data';

void main() {
  final myList = MyList();
  print(myList.length);

  myList.add(10);
  myList.add(1);
  print(myList.length);
  print(myList);

1onest4r

import 'dart:typed_data';

void main() {
  final myList = MyList();
  print(myList.length);

  myList.add(10);
  print(myList.length);
  print(myList);

1onest4r

/*
1. Constant time complexity.
2. Linear time complexity.
3. Quadratic time complexity.
4. Logarithmic time complexity.
*/

import 'dart:math';

void main() {