stringArrayList.add("Fundamentals of Algorithmic Problem Solving"); stringArrayList.add("Algorithm Design Techniques"); stringArrayList.add("Methods of Specifying an Algorithm"); stringArrayList.add("Proving an Algorithm’s Correctness"); stringArrayList.add("Coding an Algorithm"); stringArrayList.add("Designing an Algorithm and Data Structures"); stringArrayList.add("Important Problem Types in Algorithms Analysis"); stringArrayList.add("Fundamentals of the Analysis of Algorithm Efficiency"); stringArrayList.add("Properties of Asymptotic Notations"); stringArrayList.add("The Analysis Framework"); stringArrayList.add("Empirical Analysis of Algorithms"); stringArrayList.add("Mathematical Analysis of Non recursive Algorithms"); stringArrayList.add("Mathematical Analysis of Recursive Algorithms"); stringArrayList.add("Algorithm Visualization"); stringArrayList.add("Closest Pair of Points using Divide and Conquer algorithm"); stringArrayList.add("Closest-Pair and Convex-Hull Problems by Brute Force"); stringArrayList.add("Exhaustive Search"); stringArrayList.add(" Knapsack Problem"); stringArrayList.add("DAA - Travelling Salesman Problem"); stringArrayList.add("Greedy approach vs Dynamic programming"); stringArrayList.add("Warshall’s and Floyd’s Algorithms"); stringArrayList.add("The Knapsack Problem and Memory Functions"); stringArrayList.add("Greedy Technique"); stringArrayList.add("Prim’s Algorithm"); stringArrayList.add("Kruskal’s Algorithm"); stringArrayList.add("Dijkstra’s Algorithm"); stringArrayList.add("Huffman Trees and Codes"); stringArrayList.add("Iterative Improvement"); stringArrayList.add("The Simplex Method"); stringArrayList.add("Maximum Matching in Bipartite Graphs");










if (selected.equals("Fundamentals of Algorithmic Problem Solving")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Algorithm Design Techniques")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Methods of Specifying an Algorithm")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Proving an Algorithm’s Correctness")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Coding an Algorithm")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Designing an Algorithm and Data Structures")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Important Problem Types in Algorithms Analysis")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Fundamentals of the Analysis of Algorithm Efficiency")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Properties of Asymptotic Notations")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("The Analysis Framework")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Empirical Analysis of Algorithms")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Mathematical Analysis of Non recursive Algorithms")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Mathematical Analysis of Recursive Algorithms")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Algorithm Visualization")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Closest Pair of Points using Divide and Conquer algorithm")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Closest-Pair and Convex-Hull Problems by Brute Force")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Exhaustive Search")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals(" Knapsack Problem")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("DAA - Travelling Salesman Problem")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Greedy approach vs Dynamic programming")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Warshall’s and Floyd’s Algorithms")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("The Knapsack Problem and Memory Functions")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Greedy Technique")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Prim’s Algorithm")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Kruskal’s Algorithm")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Dijkstra’s Algorithm")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Huffman Trees and Codes")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Iterative Improvement")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("The Simplex Method")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); } if (selected.equals("Maximum Matching in Bipartite Graphs")) {                     Intent i = new Intent(MainActivity.this, DetailActivity.class);                     i.putExtra("id", position);                     i.putExtra("url", "file:///android_asset/.htm");                      i.putExtra("value", adapter.getItem(position));  startActivity(i); }