| 306 | head = mergeSortHelper(head); |
| 307 | } |
| 308 | public static void main(String args[]) { |
| 309 | LL ll = new LL(); |
| 310 | |
| 311 | //Add Nodes |
| 312 | ll.addLast(5); |
| 313 | ll.addLast(4); |
| 314 | ll.addLast(3); |
| 315 | ll.addLast(2); |
| 316 | //ll.addLast(1); |
| 317 | ll.print(); |
| 318 | //System.out.println(ll.size); |
| 319 | ll.mergeSort(); |
| 320 | ll.print(); |
| 321 | /* |
| 322 | // Delete Nodes |
| 323 | ll.removeFirst(); |
| 324 | ll.removeLast(); |
| 325 | ll.removeFirst(); |
| 326 | ll.removeLast(); |
| 327 | ll.print(); |
| 328 | System.out.println(ll.size); |
| 329 | |
| 330 | // Iterative Search |
| 331 | System.out.println(ll.itSearch(1)); |
| 332 | System.out.println(ll.itSearch(5)); |
| 333 | |
| 334 | // Recursive Search |
| 335 | System.out.println(ll.recSearch(1)); |
| 336 | System.out.println(ll.recSearch(5)); |
| 337 | |
| 338 | //Reverse LL |
| 339 | ll.reverse(); |
| 340 | ll.print(); |
| 341 | */ |
| 342 | } |
| 343 | } |