Recortes de codigo / Code Snippets: July 2019

Saturday, July 27, 2019

Sort java list, lambda comparators

import java.util.ArrayList;
import java.util.List;
import java.util.Collections;
import java.util.Comparator;
 
public class Person {
     String name;
     int age;
 
     public Person(String name, int age) {
         this.name = name;
         this.age = age;
     }
 
     public
     static void sort(List<Person> l, String title, Comparator<Person> comp) {
                                 
         Collections.sort(l, comp);
         
         System.out.println(title);
         for(Person p: l) {
             System.out.println(p.name + " " + p.age);
         }
     }
 
     public static void main(String []args){
         ArrayList<Person> l = new ArrayList<>();
         l.add(new Person("A", 30));
         l.add(new Person("B", 29));
         l.add(new Person("C", 28));
         l.add(new Person("D", 27));
 
         sort(l, "Sorting by name", (p1, p2) -> p1.name.compareTo(p2.name));
         sort(l, "Sorting by age", (p1, p2) -> (p1.age - p2.age));
     }
}

Friday, July 19, 2019

Merge 2 sorted lists, merged list has reversed order

     List mergeReverse2(List list1, List list2, List soFar) {
         if(list1 == null && list2 == null) { 
             return soFar;
         }
         List following;
         if(list1 == null || list1.dato > list2.dato) {
             following = list2.next;
             list2.next = soFar;
             return mergeReverse2(list1, following, list2);
         }
         if(list2 == null || list1.dato <= list2.dato) {
             following = list1.next;
             list1.next = soFar;
             return mergeReverse2(following, list2, list1);
         }
         
         return null;
     }

Other entries:

Merge 2 sorted lists

     List merge(List list1, List list2) {
         if(list1 == null && list2 == null) {
             return null;
         }
         if(list1 == null || list1.dato > list2.dato) {
             list2.next = merge(list1, list2.next);
             return list2;
         }
         if(list2 == null || list1.dato <= list2.dato) {
             list1.next = merge(list1.next, list2);
             return list1;
         }
         
         return null;
     }

Tuesday, July 9, 2019

isPrime, Naive Version

bool isPrime0( int x ) {
  for( int divisor = 2; divisor < x; divisor++ ) {
        if( x % divisor == 0 ) { 
            return false;
        }
  }
  return true;
}

Other entries:

Sunday, July 7, 2019

Fibonacci

Version iterativa

#include <iostream>
using namespace std;

int fibonacci( int n ) {
    if( n == 0 || n == 1 ) {
       return n;
    }
    
    //  prev2 -> prev1 -> fib (prev1 + prev2)
    int prev2 = 0;
    int prev1 = 1;
    int fib;
    for(int i = 2; i <= n; i++) {
        fib = prev1 + prev2;
        prev2 = prev1;
        prev1 = fib;
    }
    
    return fib;
}
 
int main() {
    for(int i = 0; i < 10; i++) {
        cout << "fib " << i << " = " << fibonacci(i) << endl;
    }

    return 0;
}

Decimal a binario

Version recursiva

#include <iostream>
using namespace std;

string binario(int x) {
    string s = (x > 1) ? binario(x / 2) : "";
    s += to_string(x % 2);
    return s;
}

int main() {
    for(int i = 0; i < 256; i++) {
        cout << i << " " << binario(i) << endl;
    }
}

Other entries: