Merge pull request #134 from raj-rathod/rajesh

feat:<Selection sort> selection sort image add

Author: raj-rathod

src/app/components/Algorithms/sorting/selection-sort/selection-sort.component.html

@@ -1,9 +1,9 @@
 <h1 class="text-center">Selection Sort</h1>
 <div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.defination"></div>
-<div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.explainImage"></div>
 <div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.properties"></div>
-<div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.flowChart"></div>
 <div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.workingProcedure"></div>
+<div class="mt-md-4 mt-3 col-md-7" [innerHtml]="selectionSortMetaData.flowChart"></div>
+<div class="mt-md-4 mt-3 col-md-7" [innerHtml]="selectionSortMetaData.explainImage"></div>
 <div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.applications"></div>
 <div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.advantage"></div>
 <div class="mt-md-4 mt-3" [innerHtml]="selectionSortMetaData.disadvantage"></div>

src/app/components/Algorithms/sorting/sorting-algorithm/sorting-algorithm.component.html

@@ -3,7 +3,7 @@ <h1 class="text-center">Sorting Algorithms</h1>
 <div class="mt-md-4 mt-3" [innerHtml]="sortingMetaData.properties"></div>
 <div class="mt-md-4 mt-3 d-flex align-items-center horizontal-scroll">
     <ng-container *ngFor="let data of sortingType; let i = index">
-     <div *ngIf="i !=0" class="box p-lg-2 p-1 px-lg-3 px-2 tab me-lg-4 me-3" [routerLink]="data.route">
+     <div class="box p-lg-2 p-1 px-lg-3 px-2 tab me-lg-4 me-3" [routerLink]="data.route">
           <p class="m-0">{{data.name}}</p>
      </div>
     </ng-container>

src/app/core/algorithms/sorting-meta-data.ts

@@ -58,8 +58,8 @@ const selectionSortData = {
     Initially, the sorted part is empty and the unsorted part is the entire list. <br>
     The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes 
     a part of the sorted array. This process continues moving unsorted array boundary by one element to the right.`,
-    flowChart:"assets/ds-image/DSA-404.webp",
-    explainImage:"assets/ds-image/DSA-404.webp",
+    flowChart:"assets/ds-image/selection-sort-flowchart.jpg",
+    explainImage:"assets/ds-image/selection-sort.jpg",
     workingProcedure:[
         'Initialize minimum value(minValue) to location 0.',
         'Traverse the array to find the minimum element in the array.',

src/app/core/meta-data/meta-data.ts

@@ -57,7 +57,7 @@ export const contact: string[] =[
 
 export const pageMetaData = {
     home:{
-        title:"Data Structures and Algorithms | Visualization",
+        title:"Data Structures and Algorithms | DSA Visualization",
         description:`All the points of data structures and algorithms like as working approach, properties, 
           operations, applications, advantages and disadvantages are well explained and visualize the operations 
           for better understanding`,
@@ -116,7 +116,7 @@ export const pageMetaData = {
         Queue Disadvantages, Enqueue and Dequeue Operations`
     },
     linkedList:{
-        title:"Linked List Operations and Visualization | Dsa Visualization",
+        title:"Linked List Operations and Visualization | DSA Visualization",
         description:`What is the linked list, what is the use of the linked list, what is the single linked list, 
         what is the use of the single linked list, what is the double linked list, what is the use of the double linked list,
         application of the linked list and advantages and disadvantages of the linked list`,

src/app/core/meta-data/router-meta-data.ts

@@ -88,10 +88,10 @@ export const algorithms: RouterLinkData[] = [
 ];
 
 export const sorting: RouterLinkData[] = [
-    {
-        name: "Bubble Sort",
-        route: "/algorithm/sorting/bubble-sort"
-    },
+    // {
+    //     name: "Bubble Sort",
+    //     route: "/algorithm/sorting/bubble-sort"
+    // },
     {
         name: "Selection Sort",
         route: "/algorithm/sorting/selection-sort"
@@ -151,10 +151,10 @@ export const searchingLinks: RouterLinkData[] = [
         name: "Exponential Search",
         route: "/algorithm/searching/exponential-search"
     },
-    {
-        name: "Fibonacci Search",
-        route: "/algorithm/searching/fibonacci-search"
-    },
+    // {
+    //     name: "Fibonacci Search",
+    //     route: "/algorithm/searching/fibonacci-search"
+    // },
 ];
 
 export const divideAndConquerLinks: RouterLinkData[] = [
@@ -166,16 +166,16 @@ export const divideAndConquerLinks: RouterLinkData[] = [
         name: "Quick Sort",
         route: "/algorithm/sorting/quick-sort"
     },
-    {
-        name: "Strassen's Algorithm",
-        route: "/algorithm/divide-and-conquer/strassen"
-    },
-    {
-        name: "Closest Pair of Points",
-        route: "/algorithm/divide-and-conquer/closest-pair-of-points"
-    },
-    {
-        name: "Karatsuba Algorithm",
-        route: "/algorithm/divide-and-conquer/karatsuba"
-    }
+    // {
+    //     name: "Strassen's Algorithm",
+    //     route: "/algorithm/divide-and-conquer/strassen"
+    // },
+    // {
+    //     name: "Closest Pair of Points",
+    //     route: "/algorithm/divide-and-conquer/closest-pair-of-points"
+    // },
+    // {
+    //     name: "Karatsuba Algorithm",
+    //     route: "/algorithm/divide-and-conquer/karatsuba"
+    // }
 ];