ABC: Always Be Coding — Tech Talk — Medium

ABC: Always Be Coding — Tech Talk — Medium: This is a very good read and tips for interview warriors.

Interesting read.,Disruptive technologies: Advances that will transform life, business, and the global economy | McKinsey & Company

According to Disruptive technologies: Advances that will transform life, business, and the global economy | McKinsey & Company: here, technology development can be contributing to fuel a $33 Trillion dollar industry. But I feel with the latest introduction of X-Box One, we are heading back with VCR days.  may be it  is just me, the latest console looks like a VCR aka Video cassette recorder. But the report is 178 pages- good read for the long weekend.

Google IO 2013- 3 Hours

Wow 3 hours for a key note.,

Couple of programs- Bubble sort and Fibonacci series.

Wanted to play with practice couple of items -

Simple bubble sort

    public static void simpleBubbleSort() {

        int[] arr = {12, 23, 43, 34, 3, 6, 7, 1, 9, 6, 0};

        {

            int temp;

            int tempLength = arr.length;

            for (int arrlen = 0; arrlen < tempLength - 1; arrlen++) {

                System.out.println("The arrlen is" + arrlen);

                for (int temparrlen = 0; temparrlen < tempLength - 1; temparrlen++) {

                    System.out.println("The temparrlen is" + temparrlen);

                    if (arr[temparrlen] > arr[temparrlen + 1]) {

                        temp = arr[temparrlen];

                        arr[temparrlen] = arr[temparrlen + 1];

                        arr[temparrlen + 1] = temp;

                    }

                }

            }

        }

        for (int i = 0; i < arr.length; i++) {

            System.out.print(arr[i] + " ");

        }

    }

Simple Fibonacci series iterator using tail recurssion

    public static int fibnnoaci(int term) {

        return generateFibnnoaci(term, 1, 1);

    }

    public static int generateFibnnoaci(int term, int lower, int higher) {

        if (term < 2) {

            return higher;

        }

        int results = generateFibnnoaci(term - 1, higher, higher + lower);

        return results;

    }

Good Dev ops information.,

Real precise and valuable information., Good all round info sharing on Pintrest scaling, some technology stack that canbe used by most of the Indie developers. Always linked from Marco's tech bytes